Track layouts, layered path decompositions, and leveled planarity
From MaRDI portal
Publication:1739109
DOI10.1007/s00453-018-0487-5zbMath1421.68105arXiv1506.09145MaRDI QIDQ1739109
David R. Wood, David Eppstein, Vida Dujmović, Michael J. Bannister, William E. Devanny
Publication date: 25 April 2019
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.09145
treewidth; outerplanar graphs; Halin graphs; parameterized complexity; tree-depth; almost-tree number; layered path decompositions; layered pathwidth; leveled planar graphs; square graphs; track layouts; track-number; unit disc graphs
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C10: Planar graphs; geometric and topological aspects of graph theory