42 search results - page 1 / 9 » On the Maximum Cardinality Search Lower Bound for Treewidth |
WG
2004
Springer
15 years 8 months ago
2004
Springer
127
click to vote
ESA
2004
Springer
15 years 8 months ago
2004
Springer
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
112
click to vote
EOR
2006
15 years 3 months ago
2006
We consider the problem of partitioning a set of positive integers values into a given number of subsets, each having an associated cardinality limit, so that the maximum sum of v...
138
click to vote
CP
2003
Springer
15 years 8 months ago
2003
Springer
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
128
Voted
AAAI
2006
15 years 4 months ago
2006
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...