article

Tree-decompositions of small pathwidth

Author:

Jan Arne TelleAuthors Info & Claims

Discrete Applied Mathematics, Volume 145, Issue 2

Pages 210 - 218

Published: 15 January 2005 Publication History

Abstract

Motivated by the desire to speed up dynamic programming algorithms for graphs of bounded treewidth, we initiate a study of the tradeoff between width and pathwidth of tree-decompositions. We therefore investigate the catwidth parameter catw(G) which is the minimum width of any tree-decomposition (T,X) of a graph G when the pathwidth pw(T) of the tree T is 1. The catwidth parameter lies between the treewidth and the pathwidth of the graph, tw(G)=

References

[1]

Alber, J., Bodlaender, H.L., Fernau, H. and Niedermeier, R., Fixed parameter algorithms for planar dominating set and related problems. Algorithmica. v33. 461-493.

[2]

J. Alber, H. Fernau, R. Niedermeier, Parameterized complexity: exponential speed-up for planar graph problems, Proceedings ICALP 2001, Crete, Greece, Lecture Notes in Computer Science, vol. 2076, Springer, Berlin, 2001, pp. 261-272.

Digital Library

[3]

J. Alber, R. Niedermeier, Improved tree decomposition based algorithms for domination-like problems, in: Proceedings LATIN 2002. Cancun, Mexico, April 2002, Lecture Notes in Computer Science, Springer, Berlin, 2001.

Digital Library

[4]

Arnborg, S., Corneil, D. and Proskurowski, A., Complexity of finding embeddings in a k-tree. SIAM J. Alg. Discr. Meth. v8. 277-284.

Digital Library

[5]

B. Aspvall, A. Proskurowski, J.A. Telle, in: H. Bodlaender (Ed.), Memory requirements for table computations in partial k-tree algorithms, Algorithmica 27(3) (2000) 382-394 (Special issue on Treewidth, Graph Minors and Algorithms).

[6]

Bodlaender, H., Gustedt, J. and Telle, J.A., Linear-time register allocation for a fixed number of registers. In: Proceedings of the SODA'98, pp. 574-583.

Digital Library

[7]

H. Bodlaender, Treewidth: algorithmic techniques and results, Proceedings MFCS'97, Lecture Notes in Computer Science, vol. 1295, Springer, Berlin, 1997, pp. 29-36.

Digital Library

[8]

H. Bodlaender, T. Hagerup, Tree decompositions of small diameter, Proceedings MFCS'98, Lecture Notes in Computer Science, vol. 1450, Springer, Berlin, 1998, pp. 702-712.

Digital Library

[9]

Bodlaender, H. and Möhring, R., The pathwidth and treewidth of cographs. SIAM J. Discr. Math. v6 i2. 181-188.

Digital Library

[10]

Corneil, D., Olariu, S. and Stewart, L., Asteroidal triple-free graphs. SIAM J. Discr. Math. v10 i3. 399-430.

Digital Library

[11]

Ellis, J.A., Sudborough, I.H. and Turner, J.S., The vertex separation number and search number of a graph. Inform. Comput. v113. 50-79.

Digital Library

[12]

J. Gustedt, O. Mæhle, J.A. Telle, The treewidth of Java programs, Proceedings ALENEX'02-Fourth Workshop on Algorithm Engineering and Experiments, San Francisco, January 4-5, 2002, Lecture Notes in Computer Science, Springer, Berlin, vol. 2409.

Digital Library

[13]

M. Habib, C. Paul, J.A. Telle, A linear-time algorithm for recognition of catval graphs, Montpellier TR-LIRMM 03-004, March 2003.

[14]

Kinnersley, N.G. and Langston, M.A., Obstruction set isolation for the Gate matrix layout problem. Discr. Appl. Math. v54. 169-213.

Digital Library

[15]

Lekkerkerker, C.G. and Boland, J.Ch., Representation of a finite graph by a set of intervals on the real line. Fund. Math. v51. 45-64.

[16]

Möhring, R., Triangulating graphs without asteroidal triples. Discr. Appl. Math. v64. 281-287.

Digital Library

[17]

Parra, A., Triangulating multitolerance graphs. Discr. Appl. Math. v84. 183-197.

Digital Library

[18]

Robertson, N. and Seymour, P., Graph minors I. Excluding a forest. J. Combin. Theory B. v35. 39-61.

[19]

Thorup, M., Structured programs have small tree-width and good register allocation. Inform. Comput. v142. 159-181.

Digital Library

Cited By

Baste JGözüpek DShalom MThilikos D(2021)Minimum Reload Cost Graph FactorsTheory of Computing Systems10.1007/s00224-020-10012-x65:5(815-838)Online publication date: 1-Jul-2021
https://dl.acm.org/doi/10.1007/s00224-020-10012-x
Ziedan ERajendraprasad DMathew RGolumbic MDusart J(2018)The Induced Separation Dimension of a GraphAlgorithmica10.1007/s00453-017-0353-x80:10(2834-2848)Online publication date: 1-Oct-2018
https://dl.acm.org/doi/10.1007/s00453-017-0353-x
Ziedan ERajendraprasad DMathew RGolumbic MDusart J(2016)Induced Separation DimensionRevised Selected Papers of the 42nd International Workshop on Graph-Theoretic Concepts in Computer Science - Volume 994110.1007/978-3-662-53536-3_11(121-132)Online publication date: 22-Jun-2016
https://dl.acm.org/doi/10.1007/978-3-662-53536-3_11
Show More Cited By

Index Terms

Tree-decompositions of small pathwidth
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Trees
2. Theory of computation
  1. Design and analysis of algorithms
    1. Algorithm design techniques
      1. Dynamic programming
  2. Randomness, geometry and discrete structures
    1. Computational geometry

Recommendations

Grundy Distinguishes Treewidth from Pathwidth

Structural graph parameters, such as treewidth, pathwidth, and clique-width, are a central topic of study in parameterized complexity. A main aim of research in this area is to understand the “price of generality” of these widths: as we transition from more ...
Read More
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

In this paper, we give for constant $k$ a linear-time algorithm that, given a graph $G=(V,E)$, determines whether the treewidth of $G$ is at most $k$ and, if so, finds a tree-decomposition of $G$ with treewidth at most $k$. A consequence is that ...
Read More
On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs

Dynamic programming on path and tree decompositions of graphs is a technique that is ubiquitous in the field of parameterized and exponential-time algorithms. However, one of its drawbacks is that the space usage is exponential in the decomposition’s ...
Read More

Comments

Information & Contributors

Information

Published In

cover image Discrete Applied Mathematics

Discrete Applied Mathematics Volume 145, Issue 2

Structural decompositions, width parameters, and graph labelings (DAS 5)

15 January 2005

263 pages

ISSN:0166-218X

Issue’s Table of Contents

Copyright © Elsevier B.V. © 2004.

Publisher

Elsevier Science Publishers B. V.

Netherlands

Publication History

Published: 15 January 2005

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Other Metrics

View Author Metrics

Citations

Cited By

Baste JGözüpek DShalom MThilikos D(2021)Minimum Reload Cost Graph FactorsTheory of Computing Systems10.1007/s00224-020-10012-x65:5(815-838)Online publication date: 1-Jul-2021
https://dl.acm.org/doi/10.1007/s00224-020-10012-x
Ziedan ERajendraprasad DMathew RGolumbic MDusart J(2018)The Induced Separation Dimension of a GraphAlgorithmica10.1007/s00453-017-0353-x80:10(2834-2848)Online publication date: 1-Oct-2018
https://dl.acm.org/doi/10.1007/s00453-017-0353-x
Ziedan ERajendraprasad DMathew RGolumbic MDusart J(2016)Induced Separation DimensionRevised Selected Papers of the 42nd International Workshop on Graph-Theoretic Concepts in Computer Science - Volume 994110.1007/978-3-662-53536-3_11(121-132)Online publication date: 22-Jun-2016
https://dl.acm.org/doi/10.1007/978-3-662-53536-3_11
Bodlaender HFomin F(2005)Tree decompositions with small costDiscrete Applied Mathematics10.5555/1056106.1704943145:2(143-154)Online publication date: 15-Jan-2005
https://dl.acm.org/doi/10.5555/1056106.1704943

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents