24 search results - page 1 / 5 » Algorithmic Meta-theorems for Restrictions of Treewidth |
STACS
2010
Springer
13 years 11 months ago
2010
Springer
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [2],[19]. We give restricted spa...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
Classes of graphs with bounded expansion have been introduced in [15], [12]. They generalize both proper minor closed classes and classes with bounded degree. For any class with b...
STACS
2010
Springer
13 years 11 months ago
2010
Springer
We present a method for reducing the treewidth of a graph while preserving all the minimal s−t separators. This technique turns out to be very useful in the design of parameteriz...
ESA
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
UAI
2008
13 years 6 months ago
2008
It is well-known that inference in graphical models is hard in the worst case, but tractable for models with bounded treewidth. We ask whether treewidth is the only structural cri...