Anytime Hybrid Best-First Search with Tree Decomposition for Weighted CSP

2015 ◽  
pp. 12-29 ◽  
Author(s):  
David Allouche ◽  
Simon de Givry ◽  
George Katsirelos ◽  
Thomas Schiex ◽  
Matthias Zytnicki
Keyword(s):  
Tree Decomposition ◽  
Best First Search ◽  
Weighted Csp

Dynamic Heuristics for Branch and Bound on Tree-Decomposition of Weighted CSPs

2010 ◽  
pp. 317-332
Author(s):  
Philippe Jgou ◽  
Samba Ndojh Ndiaye ◽  
Cyril Terrioux
Keyword(s):  
Branch And Bound ◽  
Tree Decomposition

AN IMPROVED ALGORITHM FOR FINDING TREE DECOMPOSITIONS OF SMALL WIDTH

2000 ◽  
Vol 11 (03) ◽  
pp. 365-371 ◽  
Author(s):  
LJUBOMIR PERKOVIĆ ◽  
BRUCE REED
Keyword(s):  
Linear Time ◽  
Time Algorithm ◽  
Tree Decomposition ◽  
Linear Time Algorithm ◽  
Input Graph ◽  
Primary Motivation ◽  
Small Width ◽  
Tree Decompositions ◽  
Improved Algorithm

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.

Properties of boolean functions with a tree decomposition

1974 ◽  
Vol 14 (1) ◽  
pp. 1-13 ◽  
Author(s):  
G. V. Bochmann ◽  
W. W. Armstrong
Keyword(s):  
Boolean Functions ◽  
Tree Decomposition

Tree Decomposition of Multiclass Problems

2008 ◽  
Author(s):  
Ana C. Lorena ◽  
André C.P.L.F. de Carvalho
Keyword(s):  
Tree Decomposition

scholarly journals Two Short Proofs Concerning Tree-Decompositions

2002 ◽  
Vol 11 (6) ◽  
pp. 541-547 ◽  
Author(s):  
PATRICK BELLENBAUM ◽  
REINHARD DIESTEL
Keyword(s):  
Duality Theorem ◽  
Finite Graph ◽  
Tree Decomposition ◽  
Tree Width ◽  
Tree Decompositions

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.

Sign in / Sign up

Export Citation Format

Share Document