Bundled Crossings Revisited
From MaRDI portal
Publication:5141645
DOI10.7155/jgaa.00535zbMath1451.05224OpenAlexW3104617191MaRDI QIDQ5141645
Myroslav Kryven, Steven Chaplick, Thomas C. van Dijk, Ji-won Park, Alexander Wolff, O. V. Ravskyj
Publication date: 18 December 2020
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00535
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Edge routing with ordered bundles
- Graph minors. III. Planar tree-width
- Degenerate crossing numbers
- Linear algorithms to recognize outerplanar and maximal outerplanar graphs
- On the number of arrangements of pseudolines
- On the degenerate crossing number
- The graph crossing number and its variants: a survey
- Bundled crossings revisited
- Nonserial dynamic programming
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Bundled Crossings in Embedded Graphs
- Algebraic and geometric methods in enumerative combinatorics
- The Degenerate Crossing Number and Higher-Genus Embeddings
- The Bundled Crossing Number
- The graph genus problem is NP-complete
- Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams
- The genus crossing number
- 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
