This paper investigates algorithms for some related graph parameters. Each asks for a linear ordering of the vertices of the graph (or can be formulated as such), and there are constructive linear time algorithms for the fixed parameter versions of the problems. Examples are cutwidth, pathwidth, and directed or weighted variants of these. However, these algorithms have complicated technical details. This paper attempts to present these algorithms in a different more easily accessible manner, by showing that the algorithms can be obtained by a stepwise modification of a trivial hypothetical non-deterministic, algorithm. The methodology is applied for a generalisation of the cutwidth problem to weighted mixed graphs. As a consequence, we obtain new algorithmic results for various problems like modified cutwidth, and rederive known results for other related problems with simpler proofs. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Bodlaender, H. L., Fellows, M. R., & Thilikos, D. M. (2003). Starting with nondeterminism: The systematic derivation of linear-time graph layout algorithms. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2747, 239–248. https://doi.org/10.1007/978-3-540-45138-9_18
Mendeley helps you to discover research relevant for your work.