A polynomial time algorithm for the cutwidth of bounded degree graphs with small treewidth

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2161, Issue , 2001, Pages 380-390

  Thilikos, Dimitrios M ^a   Serna, Maria J ^a   Bodlaender, Hans L ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

ALGORITHM COMPUTING; BOUNDED DEGREE; BOUNDED DEGREE GRAPHS; PATHWIDTH; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; TREE-WIDTH; VERTEX ORDERING;

TREES (MATHEMATICS);

EID: 84943243932     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44676-1_32     Document Type: Conference Paper

References (21)

1. K. R. Abrahamson and M. R. Fellows. Finite automata, bounded treewidth and well-quasiordering. In N. Robertson and P. Seymour, editors, Proceedings of the AMS Summer Workshop on Graph Minors, Graph Structure Theory, Contemporary Mathematics vol. 147, pages, 539-564. American Mathematical Society, 1993.
2. H. L. Bodlaender. Improved self-reduction algorithms for graphs with bounded treewidth. Discrete Appl. Math., 54:101-115, 1994.
3. H. L. Bodlaender. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput., 25(6):1305-1317, 1996.
4. H. L. Bodlaender. Treewidth: algorithmic techniques and results. In Mathematical foundations of computer science 1997 (Bratislava), pages, 19-36. Springer, Berlin, 1997.
5. H. L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci., 209(1-2):1-45, 1998.
6. H. L. Bodlaender and T. Kloks. Efficient and constructive algorithms for the pathwidth and treewidth of graphs. Journal of Algorithms, 21:358-402, 1996.
7. H. L. Bodlaender and D. M. Thilikos. Computing small search numbers in lin-ear time. Technical Report UU-CS-1998-05, Dept. of Computer Science, Utrecht University, 1998.
8. M. Chung, F. Makedon, I. H. Sudborough, and J. Turner. Polynomial time al-gorithms for the min cut problem on degree restricted trees. In Symposium on foundations of computer science, volume 23, pages, 262-271, Chicago, Nov. 1982.
9. J. Díaz, J. Petit, and M. Serna. A survey on graph layout problems. Technical Report LSI-00-61-R, Departament de Llenguatges i Sistemes Informàticss, Universitat Politècnica de Catalunya, Barcelona, Spain, 2000.
10. M. R. Fellows and M. A. Langston. On well-partial-order theory and its application to combinatorial problems of VLSI design. SIAM J. Disc. Meth., 5:117-126, 1992.
11. M. R. Fellows and M. A. Langston. On search, decision and the efficiency of polynomial-time algorithms. J. Comp. Syst. Sc., 49:769-779, 1994.
12. L. H. Harper. Optimal assignments of number to vertices. SIAM Journal, 12(1):131-135, 1964.
13. F. S. Makedon and I. H. Sudborough. On minimizing width in linear layouts. Discrete Appl. Math., 23:243-265, 1989.
14. K. Nakano. Linear layouts of generalized hypercubes. In J. van Leewen, editor, Graph-theoretic concepts in computer science, volume 790 of Lecture Notes in Computer Science, pages, 364-375. Springer-Verlag, 1994.
15. N. Robertson and P. D. Seymour. Graph minors. I. Excluding a forest. J. Comb. Theory Series B, 35:39-61, 1983.
16. N. Robertson and P. D. Seymour. Graph minors. III. Planar tree-width. J. Comb. Theory Series B, 36:49-64, 1984.
17. N. Robertson and P. D. Seymour. Graph minors | a survey. In I. Anderson, editor, Surveys in Combinatorics, pages, 153-171. Cambridge Univ. Press, 1985.
18. D. M. Thilikos and H. L. Bodlaender. Constructive linear time algorithms for branchwidth. Technical Report UU-CS-2000-38, Dept. of Computer Science, Utrecht University, 2000.
19. D. M. Thilikos, M. J. Serna, and H. L. Bodlaender. Constructinve linear time algorithms for small cutwidth and carving-width. In D. Lee and S.-H. Teng, editors, Proc. 11th Internatinal Conference ISAAC 2000, pages, 192-203. Springer-Verlag, Lectures Notes in Computer Science, nr. 1969, 2000.
20. D. M. Thilikos, M. J. Serna, and H. L. Bodlaender. A polynomial time algorithm for the cutwidth of bounded degree graphs with small treewidth. Technical Re-port LSI-01-04-R, Departament de Llenguatges i Sistemes Informáticss, Universitat Politècnica de Catalunya, Barcelona, Spain, 2001. http://www.lsi.upc.es/sedthilk/dlogn.ps.
21. M. Yannakakis. A polynomial algorithm for the min-cut linear arrangement of trees. J. ACM, 32:950-988, 1985.