Sciweavers

72 search results - page 1 / 15
» A Branch and Bound Algorithm for Exact, Upper, and Lower Bou...
Sort
View
AAIM
2006
Springer
134views Algorithms» more  AAIM 2006»
13 years 10 months ago
A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth
Emgad H. Bachoore, Hans L. Bodlaender
UAI
2004
13 years 6 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
SOFSEM
2005
Springer
13 years 10 months ago
Discovering Treewidth
Abstract. Treewidth is a graph parameter with several interesting theoretical and practical applications. This survey reviews algorithmic results on determining the treewidth of a ...
Hans L. Bodlaender
BMCBI
2006
141views more  BMCBI 2006»
13 years 4 months ago
Maximum common subgraph: some upper bound and lower bound results
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
Xiuzhen Huang, Jing Lai, Steven F. Jennings
CSL
2007
Springer
13 years 11 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 verification, as it is equivalent to the problem of model-checking the mod...
Jan Obdrzálek