7129 search results - page 16 / 1426 » Approximation Algorithms for Treewidth |
PODS
2007
ACM
14 years 10 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
KR
2010
Springer
14 years 2 months ago
2010
Springer
Abstract argumentation frameworks have received a lot of interest in recent years. Most computational problems in this area are intractable but several tractable fragments have be...
DAM
2006
13 years 9 months ago
2006
We observe that a formula given by S. Negami [Trans. Amer. Math. Soc. 299 (1987), 601-622] for the Tutte polynomial of a k-sum of two graphs generalizes to a colored Tutte polynom...
WG
1995
Springer
14 years 1 months ago
1995
Springer
Abstract. In this paper, we investigate which processor networks allow klabel Interval Routing Schemes, under the assumption that costs of edges may vary. We show that for each xed...
ESA
2004
Springer
14 years 3 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 ...