34 search results - page 1 / 7 » New Upper Bound Heuristics for Treewidth |
WEA
2005
Springer
14 years 4 months ago
2005
Springer
SOFSEM
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. Treewidth is a graph parameter with several interesting theoretical and practical applications. This survey reviews algorithmic results on determining the treewidth of a ...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
In MaxSat, we ask for an assignment which satisfies the maximum number of clauses for a boolean formula in CNF. We present an algorithm yielding a run time upper bound of O (2 K 6....
EVOW
2007
Springer
14 years 5 months ago
2007
Springer
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
UAI
2004
14 years 7 days 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 ...