Sciweavers

Share
CORR
2010
Springer
126views Education» more  CORR 2010»
8 years 8 months ago
From Pathwidth to Connected Pathwidth
It is proven that the connected pathwidth of any graph G is at most 2
Dariusz Dereniowski
WG
1997
Springer
9 years 4 months ago
Parallel Algorithms for Treewidth Two
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 ...
Babette de Fluiter, Hans L. Bodlaender
books