Derivation of algorithms for cutwidth and related graph layout parameters

Journal of Computer and System Sciences

Volumn 75, Issue 4, 2009, Pages 231-244

  Bodlaender, Hans L ^a   Fellows, Michael R ^b   Thilikos, Dimitrios M ^c  

^a UTRECHT UNIVERSITY   (Netherlands)

^b UNIVERSITY OF NEWCASTLE   (Australia)

^c UNIVERSITY OF ATHENS   (Greece)

Author keywords

Cutwidth; Finite state automata; Layout parameters; Modified cutwidth; Parameterized algorithms; Pathwidth

Indexed keywords

CLUSTERING ALGORITHMS; FINITE AUTOMATA; PARAMETER ESTIMATION;

CUTWIDTHS; GRAPH PARAMETERS; LAYOUT PARAMETERS; LINEAR-TIME ALGORITHMS; NONDETERMINISTIC ALGORITHMS; PARAMETERIZED ALGORITHM; PATHWIDTH; TECHNICAL DETAILS;

GRAPH ALGORITHMS;

EID: 62049086290     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2008.10.003     Document Type: Article

References (22)

1. Abrahamson K.R., and Fellows M.R. Finite automata, bounded treewidth and well-quasiordering. In: Robertson N., and Seymour P. (Eds). Proceedings of the AMS Summer Workshop on Graph Minors, Graph Structure Theory. Contemp. Math. vol. 147 (1993), Amer. Math. Soc. 539-564
2. Bodlaender H., Gustedt J., and Telle J.A. Linear-time register allocation for a fixed number of registers. Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. San Francisco, CA, 1998 (1998), ACM, New York 574-583
3. Bodlaender H.L. Treewidth: Algorithmic techniques and results. In: Privara I., and Ruzicka P. (Eds). Proceedings 22nd International Symposium on Mathematical Foundations of Computer Science, MFCS'97. Lecture Notes in Comput. Sci. vol. 1295 (1997), Springer-Verlag, Berlin 19-36
4. Bodlaender H.L. A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci. 209 (1998) 1-45
5. Bodlaender H.L. A linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25 (1996) 1305-1317
6. Bodlaender H.L., Fellows M.R., and Evans P.A. Finite-state computability of annotations of strings and trees. Proc. Conference on Pattern Matching (1996) 384-391
7. Bodlaender H.L., Fellows M.R., and Thilikos D.M. Starting with nondeterminism: The systematic derivation of linear-time graph layout algorithms. In: Rovan B., and Vojtáš P. (Eds). Proceedings 28th International Symposium on Mathematical Foundations of Computer Science, MFCS'03. Lecture Notes in Comput. Sci. vol. 2747 (2003), Springer-Verlag, Berlin 239-284
8. Bodlaender H.L., and Kloks T. Efficient and constructive algorithms for the pathwidth and treewidth of graphs. J. Algorithms 21 (1996) 358-402
9. Bodlaender H.L., and Thilikos D.M. Constructive linear time algorithms for branchwidth. In: Degano P., Gorrieri R., and Marchetti-Spaccamela A. (Eds). Proceedings 24th International Colloquium on Automata, Languages, and Programming. Lecture Notes in Comput. Sci. vol. 1256 (1997), Springer-Verlag 627-637
10. Chen M.-H., and Lee S.-L. Linear time algorithms for the k-cutwidth problem. Proceedings Third International Symposium on Algorithms and Computation, ISAAC'92. Lecture Notes in Comput. Sci. vol. 650 (1992), Springer-Verlag, Berlin 21-30
11. Downey R.G., and Fellows M.R. Fixed-parameter tractability and completeness I: Basic results. SIAM J. Comput. 24 (1995) 873-921
12. Fellows M.R., and Langston M.A. An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations. Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989) 520-525
13. Fellows M.R., and Langston M.A. On well-partial-order theory and its application to combinatorial problems of VLSI design. SIAM J. Discrete Math. 5 (1992) 117-126
14. Kinnersley N.G. The vertex separation number of a graph equals its path width. Inform. Process. Lett. 42 (1992) 345-350
15. Kinnersley N.G., and Kinnersley W.M. Tree automata for cutwidth recognition. Congr. Numer. 104 (1994) 129-142
16. Lagergren J., and Arnborg S. Finding minimal forbidden minors using a finite congruence. Proceedings of the 18th International Colloquium on Automata, Languages and Programming. Lecture Notes in Comput. Sci. vol. 510 (1991), Springer-Verlag 532-543
17. Möhring R.H. Graph problems related to gate matrix layout and PLA folding. In: Mayr E., Noltemeier H., and Sysło M. (Eds). Computational Graph Theory. Comput. Suppl. vol. 7 (1990), Springer-Verlag 17-51
18. Monien B., and Sudborough I.H. Min cut is NP-complete for edge weighted trees. Theoret. Comput. Sci. 58 (1988) 209-229
19. Robertson N., and Seymour P.D. Graph minors. I. Excluding a forest. J. Combin. Theory Ser. B 35 (1983) 39-61
20. Serna M., and Thilikos D.M. Parameterized complexity for graph layout problems. Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 86 (2005) 41-65
21. Thilikos D.M., Serna M., and Bodlaender H.L. Cutwidth. I. A linear time fixed parameter algorithm. J. Algorithms 56 1 (2005) 1-24
22. Thilikos D.M., Serna M., and Bodlaender H.L. Cutwidth. II. Algorithms for partial w-trees of bounded degree. J. Algorithms 56 1 (2005) 25-49