AN IMPROVED ALGORITHM FOR FINDING TREE DECOMPOSITIONS OF SMALL WIDTH
2000 ◽
Vol 11
(03)
◽
pp. 365-371
◽
Keyword(s):
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.
1996 ◽
Vol 25
(6)
◽
pp. 1305-1317
◽
1996 ◽
Vol 57
(4)
◽
pp. 197-203
◽
Keyword(s):
2012 ◽
Vol 160
(3)
◽
pp. 210-217
◽
Keyword(s):