CORR
2010
Springer
13 years 1 months ago
2010
Springer
It is proven that the connected pathwidth of any graph G is at most 2
WG
1997
Springer
13 years 9 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 ...