An Improved Algorithm for Finding Tree Decompositions of Small Width

We present a modification of Bodlaender's linear time algorithm that, for constant k, determine whether an input graph G has treewidth k and, if so, constructs a tree decomposition of G of width at most k. Our algorithm has the following additional feature: if G has treewidth greater than k then a subgraph G′ of G of treewidth greater than k is returned along with a tree decomposition of G′ of width at most 2k. A consequence is that the fundamental disjoint rooted paths problem can now be solved in O(n2) time. This is the primary motivation of this paper.

[1]  RobertsonNeil,et al.  Graph minors. XIII , 1994 .

[2]  Derek G. Corneil,et al.  Complexity of finding embeddings in a k -tree , 1987 .

[3]  Ton Kloks,et al.  Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs , 1993, J. Algorithms.

[4]  Hans L. Bodlaender,et al.  A Partial k-Arboretum of Graphs with Bounded Treewidth , 1998, Theor. Comput. Sci..

[5]  Bruce A. Reed,et al.  Finding approximate separators and computing tree width quickly , 1992, STOC '92.

[6]  Hans L. Bodlaender,et al.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.

[7]  Carlo Batini,et al.  An Algorithm for Automatic Layout of Entity-Relationship Diagrams , 1983, ER.

[8]  Danny Dolev,et al.  Unanimity in an unknown and unreliable environment , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[9]  Paul D. Seymour,et al.  Graph minors. VII. Disjoint paths on a surface , 1988, J. Comb. Theory, Ser. B.

[10]  Paul D. Seymour,et al.  On the connectivity function of a matroid , 1987, J. Comb. Theory, Ser. B.

[11]  Detlef Seese,et al.  Easy Problems for Tree-Decomposable Graphs , 1991, J. Algorithms.

[12]  Neil Robertson,et al.  Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.

[13]  Bruno Courcelle,et al.  An algebraic theory of graph reduction , 1993, JACM.

[14]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

[15]  David B. Benson,et al.  Deterministic and Nondeterministic Flowchart Interpretations , 1983, J. Comput. Syst. Sci..

[16]  Paul D. Seymour,et al.  Graph minors. VI. Disjoint paths across a disc , 1986, J. Comb. Theory, Ser. B.

[17]  Jens Lagergren,et al.  Efficient Parallel Algorithms for Graphs of Bounded Tree-Width , 1996, J. Algorithms.

[18]  Marc L. Joliat.  A Simple Technique for Partial Elimination of Unit Productions from LR(k) Parsers , 1976, IEEE Transactions on Computers.