871 search results - page 97 / 175 » The vertex-cover polynomial of a graph |
CPAIOR
2004
Springer
15 years 3 months ago
2004
Springer
This paper shows that existing definitions of costs associated with soft global constraints are not sufficient to deal with all the usual global constraints. We propose more expre...
CAV
2003
Springer
15 years 3 months ago
2003
Springer
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
ECML
2006
Springer
14 years 11 months ago
2006
Springer
We propose preprocessing spectral clustering with b-matching to remove spurious edges in the adjacency graph prior to clustering. B-matching is a generalization of traditional maxi...
ECAI
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Algorithms for probabilistic inference in Bayesian networks are known to have running times that are worst-case exponential in the size of the network. For networks with ...
111
click to vote
ANTSW
2010
Springer
14 years 7 months ago
2010
Springer
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...