101
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
It is proven that the connected pathwidth of any graph G is at most 2
96
Voted
WG
1997
Springer
15 years 5 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 ...