Bundled crossings revisited

DOI10.7155/JGAA.00535MaRDI QIDQ5141645zbMATH OpenOpenAlexFDO

Authors Steven Chaplick, Thomas C. van Dijk, Myroslav Kryven, Ji-won Park, Alexander Wolff, Oleksandr Ravs'kyj

Publication date 18 December 2020

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/jgaa.00535

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Bundled Crossings in Embedded Graphs
• The Bundled Crossing Number
• Approximating the Bundled Crossing Number
• Edge routing with ordered bundles

Cites work

• A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
• Algebraic and geometric methods in enumerative combinatorics
• Beyond outerplanarity
• Block crossings in storyline visualizations
• Bundled Crossings in Embedded Graphs
• Bundled crossings revisited
• Computing a canonical polygonal schema of an orientable triangulated surface
• Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
• Degenerate crossing numbers
• Edge routing with ordered bundles
• Extending drawings of graphs to arrangements of pseudolines
• Graph minors. III. Planar tree-width
• Graph structure and monadic second-order logic. A language-theoretic approach
• scientific article; zbMATH DE number 5485473 (Why is no real title available?)
• Linear algorithms to recognize outerplanar and maximal outerplanar graphs
• Nonserial dynamic programming
• On the degenerate crossing number
• On the number of arrangements of pseudolines
• Ordering metro lines by block crossings
• The Bundled Crossing Number
• The Degenerate Crossing Number and Higher-Genus Embeddings
• The genus crossing number
• The graph crossing number and its variants: a survey
• The graph genus problem is NP-complete
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs

Cited in

(11)

• Bundled crossings revisited
• Edge routing with ordered bundles
• On minimizing crossings in storyline visualizations
• The Bundled Crossing Number
• Improving layered graph layouts with edge bundling
• scientific article; zbMATH DE number 1330160 (Why is no real title available?)
• The degenerate crossing number and higher-genus embeddings
• Approximating the Bundled Crossing Number
• Storylines with a protagonist
• Bounding the treewidth of outer k-planar graphs via triangulations
• String graph obstacles of high girth and of bounded degree

This page was built for publication: Bundled crossings revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5141645)