Abstract
The cutwidth of a graph G is defined as the smallest integer k such that the vertices of G can be arranged in a vertex ordering [v 1,...,v n ] in a way that, for every i = 1,..., n - 1, there are at most k edges with the one endpoint in v 1,...,v i and the other in v i+1,..., v n . We examine the problem of computing in polynomial time the cutwidth of a partial w-tree with bounded degree. In particular, we show how to construct an algorithm that, in \( n^{O((wd)^2 )} \) steps, computes the cutwidth of any partial w-tree with vertices of degree bounded by a fixed constant d. Our algorithm is constructive in the sense that it can be adapted to output the corresponding optimal vertex ordering. Also, it is the main subroutine of an algorithm computing the pathwidth of a bounded degree partial w-tree in \( n^{O((wd)^2 )} \) steps.
The work of all the authors was supported by the IST Program of the EU under contract number IST-99-14186 (ALCOM-FT) and, for the first two authors, by the Spanish CYCIT TIC-2000-1970-CE. The work of the first author was partially supported by the Ministry of Education and Culture of Spain, Grant number MEC-DGES SB98 0K148809.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
H. L. Bodlaender. Improved self-reduction algorithms for graphs with bounded treewidth. Discrete Appl. Math., 54:101–115, 1994.
H. L. Bodlaender. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput., 25(6):1305–1317, 1996.
H. L. Bodlaender. Treewidth: algorithmic techniques and results. In Mathematical foundations of computer science 1997 (Bratislava), pages 19–36. Springer, Berlin, 1997.
H. L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci., 209(1–2):1–45, 1998.
H. L. Bodlaender and T. Kloks. Efficient and constructive algorithms for the pathwidth and treewidth of graphs. Journal of Algorithms, 21:358–402, 1996.
H. L. Bodlaender and D. M. Thilikos. Computing small search numbers in linear time. Technical Report UU-CS-1998-05, Dept. of Computer Science, Utrecht University, 1998.
M. Chung, F. Makedon, I. H. Sudborough, and J. Turner. Polynomial time algorithms for the min cut problem on degree restricted trees. In Symposium on foundations of computer science, volume 23, pages 262–271, Chicago, Nov. 1982.
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`aticss, Universitat Politècnica de Catalunya, Barcelona, Spain, 2000.
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.
M. R. Fellows and M. A. Langston. On search, decision and the efficiency of polynomial-time algorithms. J. Syst. Sc., 49:769–779, 1994.
L. H. Harper. Optimal assignments of number to vertices. SIAM Journal, 12(1):131–135, 1964.
F. S. Makedon and I. H. Sudborough. On minimizing width in linear layouts. Discrete Appl. Math., 23:243–265, 1989.
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.
N. Robertson and P. D. Seymour. Graph minors. I. Excluding a forest. J. Comb. Theory Series B, 35:39–61, 1983.
N. Robertson and P. D. Seymour. Graph minors. III. Planar tree-width. J. Comb. Theory Series B, 36:49–64, 1984.
N. Robertson and P. D. Seymour. Graph minors — a survey. In I. Anderson, editor, Surveys in Combinatorics, pages 153–171. Cambridge Univ. Press, 1985.
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.
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.
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 Report 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.
M. Yannakakis. A polynomial algorithm for the min-cut linear arrangement of trees. J. ACM, 32:950–988, 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Thilikos, D.M., Serna, M.J., Bodlaender, H.L. (2001). A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth. In: auf der Heide, F.M. (eds) Algorithms — ESA 2001. ESA 2001. Lecture Notes in Computer Science, vol 2161. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44676-1_32
Download citation
DOI: https://doi.org/10.1007/3-540-44676-1_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42493-2
Online ISBN: 978-3-540-44676-7
eBook Packages: Springer Book Archive