7129 search results - page 10 / 1426 » Approximation Algorithms for Treewidth |
AAIM
2006
Springer
14 years 3 months ago
2006
Springer
GD
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. This paper surveys the theory of bidimensional graph problems. We summarize the known combinatorial and algorithmic results of this theory, the foundational Graph Minor r...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
WEA
2005
Springer
14 years 3 months ago
2005
Springer
ECAI
2010
Springer
13 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 ...