Bundled crossings revisited

DOI10.1007/978-3-030-35802-0_5OpenAlexW2991510048MaRDI QIDQ2206831

Myroslav Kryven, Steven Chaplick, Alexander Wolff, Thomas C. van Dijk, O. V. Ravskyj, Ji-won Park

Publication date: 26 October 2020

Full work available at URL: https://arxiv.org/abs/1812.04263

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (6)

Approximating the bundled crossing number ⋮ On Strict (Outer-)Confluent Graphs ⋮ Parameterized analysis and crossing minimization problems ⋮ Approximating the Bundled Crossing Number ⋮ Bundled Crossings Revisited ⋮ Crossing Layout in Non-planar Graph Drawings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge routing with ordered bundles
• Linear algorithms to recognize outerplanar and maximal outerplanar graphs
• The graph crossing number and its variants: a survey
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Bundled Crossings in Embedded Graphs
• The Bundled Crossing Number
• The graph genus problem is NP-complete
• A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
• Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
• Beyond Outerplanarity
• Ordering Metro Lines by Block Crossings
• Computing a canonical polygonal schema of an orientable triangulated surface
• Block Crossings in Storyline Visualizations
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

This page was built for publication: Bundled crossings revisited