185 search results - page 1 / 37 » Known Algorithms on Graphs of Bounded Treewidth are Probably... |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
SODA
2004
ACM
13 years 6 months ago
2004
ACM
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...
CSL
2007
Springer
13 years 11 months ago
2007
Springer
The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the mod...
STACS
2010
Springer
14 years 9 days 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...
ICALP
1995
Springer
13 years 9 months ago
1995
Springer
We describe the rst parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algori...