Fixed Parameter Tractability of Crossing Minimization of Almost-Trees

DOI10.1007/978-3-319-03841-4_30zbMath1406.68061DBLPconf/gd/BannisterES13arXiv1308.5741OpenAlexW1604825166WikidataQ56689208 ScholiaQ56689208MaRDI QIDQ2867670

David Eppstein, Joseph A. Simons, Michael J. Bannister

Publication date: 20 December 2013

Published in: Graph Drawing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

Fixed-parameter tractability for book drawing with bounded number of crossings per edge ⋮ Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth ⋮ Parameterized analysis and crossing minimization problems ⋮ 1-page and 2-page drawings with bounded number of crossings per edge ⋮ Exact learning of multitrees and almost-trees using path queries ⋮ Track Layout Is Hard ⋮ Parameterized approaches to orthogonal compaction ⋮ Track layouts, layered path decompositions, and leveled planarity

This page was built for publication: Fixed Parameter Tractability of Crossing Minimization of Almost-Trees