Sciweavers

Share
28 search results - page 1 / 6
» A Complete Anytime Algorithm for Treewidth
Sort
View
UAI
2004
12 years 11 months ago
A Complete Anytime Algorithm for Treewidth
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 ...
Vibhav Gogate, Rina Dechter
AI
1998
Springer
12 years 9 months ago
A Complete Anytime Algorithm for Number Partitioning
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...
Richard E. Korf
CSL
2007
Springer
13 years 3 months ago
Clique-Width and Parity Games
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...
Jan Obdrzálek
STACS
2010
Springer
13 years 4 months ago
Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs
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...
Bireswar Das, Jacobo Torán, Fabian Wagner
ATAL
2010
Springer
12 years 10 months ago
Pure Nash equilibria: complete characterization of hard and easy graphical games
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...
Albert Xin Jiang, MohammadAli Safari
books