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 ...