Abstract
We show that testing whether a given graph has a 3-track layout is hard, by characterizing the bipartite 3-track graphs in terms of leveled planarity. Additionally, we investigate the parameterized complexity of track layouts, showing that past methods used for book layouts do not work to parameterize the problem by treewidth or almosttree number but that the problem is (non-uniformly) fixed-parameter tractable for tree-depth. We also provide several natural classes of bipartite planar graphs, including the bipartite outerplanar graphs, squaregraphs, and dual graphs of arrangements of monotone curves, that always have 3-track layouts.
Cite
CITATION STYLE
Bannister, M. J., Devanny, W. E., Dujmović, V., Eppstein, D., & Wood, D. R. (2016). Track layout is hard. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9801 LNCS, pp. 499–510). Springer Verlag. https://doi.org/10.1007/978-3-319-50106-2_38
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
