Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth

DOI10.1007/978-3-662-45803-7_18zbMath1426.68199arXiv1408.6321OpenAlexW1576013143MaRDI QIDQ2936927

Michael J. Bannister, David Eppstein

Publication date: 7 January 2015

Published in: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (15)

The Crossing Number of the Cone of a Graph ⋮ The complexity of computing the cylindrical and the \(t\)-circle crossing number of a graph ⋮ Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth ⋮ 1-page and 2-page drawings with bounded number of crossings per edge ⋮ Upward book embeddability of \(st\)-graphs: complexity and algorithms ⋮ The Crossing Number of the Cone of a Graph ⋮ Track Layout Is Hard ⋮ Experimental Evaluation of Book Drawing Algorithms ⋮ Beyond Outerplanarity ⋮ Track layouts, layered path decompositions, and leveled planarity ⋮ Parameterized Leaf Power Recognition via Embedding into Graph Products ⋮ Layouts of Expander Graphs ⋮ A note on the crossing number of the cone of a graph ⋮ Upward Book Embeddings of st-Graphs ⋮ Parameterized leaf power recognition via embedding into graph products

This page was built for publication: Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth