Bundled Crossings in Embedded Graphs

DOI10.1007/978-3-662-49529-2_34zbMath1475.68241OpenAlexW2496778025MaRDI QIDQ2802960

Martin Fink, Kevin Verbeek, J. E. Hershberger, Subhash Suri

Publication date: 3 May 2016

Published in: LATIN 2016: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-49529-2_34

zbMATH Keywords

graph drawing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (11)

Approximating the bundled crossing number ⋮ On Strict (Outer-)Confluent Graphs ⋮ Parameterized analysis and crossing minimization problems ⋮ Approximating the Bundled Crossing Number ⋮ The Bundled Crossing Number ⋮ Block crossings in one-sided tanglegrams ⋮ Bundled crossings revisited ⋮ 1-fan-bundle-planar drawings of graphs ⋮ Bundled Crossings Revisited ⋮ Crossing Layout in Non-planar Graph Drawings ⋮ The Degenerate Crossing Number and Higher-Genus Embeddings

This page was built for publication: Bundled Crossings in Embedded Graphs