A benchmark generator of tree decomposition Mk landscapes

Author(s):  
Dirk Thierens ◽  
Tobias van Driessel
Keyword(s):  
2010 ◽  
pp. 317-332
Author(s):  
Philippe Jgou ◽  
Samba Ndojh Ndiaye ◽  
Cyril Terrioux

2000 ◽  
Vol 11 (03) ◽  
pp. 365-371 ◽  
Author(s):  
LJUBOMIR PERKOVIĆ ◽  
BRUCE REED

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.


1974 ◽  
Vol 14 (1) ◽  
pp. 1-13 ◽  
Author(s):  
G. V. Bochmann ◽  
W. W. Armstrong

2002 ◽  
Vol 11 (6) ◽  
pp. 541-547 ◽  
Author(s):  
PATRICK BELLENBAUM ◽  
REINHARD DIESTEL

We give short proofs of the following two results: Thomas's theorem that every finite graph has a linked tree-decomposition of width no greater than its tree-width; and the ‘tree-width duality theorem’ of Seymour and Thomas, that the tree-width of a finite graph is exactly one less than the largest order of its brambles.


2000 ◽  
Vol 16 (2) ◽  
pp. 199-204
Author(s):  
Cai Maocheng ◽  
Yuan Xudong
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document