Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
Data Structures and Algorithms
2018-12-18 v1 Discrete Mathematics
Combinatorics
Abstract
We investigate crossing minimization for 1-page and 2-page book drawings. We show that computing the 1-page crossing number is fixed-parameter tractable with respect to the number of crossings, that testing 2-page planarity is fixed-parameter tractable with respect to treewidth, and that computing the 2-page crossing number is fixed-parameter tractable with respect to the sum of the number of crossings and the treewidth of the input graph. We prove these results via Courcelle's theorem on the fixed-parameter tractability of properties expressible in monadic second order logic for graphs of bounded treewidth.
Keywords
Cite
@article{arxiv.1408.6321,
title = {Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth},
author = {Michael J. Bannister and David Eppstein},
journal= {arXiv preprint arXiv:1408.6321},
year = {2018}
}
Comments
Graph Drawing 2014