Join Our Newsletter
28 search results - page 1 / 6 » A Complete Anytime Algorithm for Treewidth |
UAI
2004
12 years 11 months ago
2004
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
AI
1998
Springer
12 years 9 months ago
1998
Springer
Given a set of numbers, the two-way partitioning problem is to divide them into two subsets, so that the sum of the numbers in each subset are as nearly equal as possible. The pro...
CSL
2007
Springer
13 years 3 months ago
2007
Springer
The question of the exact complexity of solving parity games is one of the major open problems in system veriļ¬cation, as it is equivalent to the problem of model-checking the mod...
STACS
2010
Springer
13 years 4 months ago
2010
Springer
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [2],[19]. We give restricted spa...
ATAL
2010
Springer
12 years 10 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
