1389 search results - page 1 / 278 » Parallel Algorithms for Treewidth Two |
WG
1997
Springer
13 years 8 months ago
1997
Springer
In this paper we present a parallel algorithm that decides whether a graph G has treewidth at most two, and if so, construct a tree decomposition or path decomposition of minimum ...
ICALP
1995
Springer
13 years 8 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...
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
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...
ESA
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We consider the multivariate interlace polynomial introduced by Courcelle (2008), which generalizes several interlace polynomials defined by Arratia, Bollob´as, and Sor...