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 width of G. The algorithm uses On operations and Olognlog n time on an EREW PRAM, or Ologn time on a CRCW PRAM. The algorithm makes use of the resemblance between series parallel graphs and partial two-trees. It is a (non-trivial) extension of the parallel algorithm for series parallel graphs that is presented in [8].

• Type: Conference
• Year: 1997
• Where: WG
• Authors: Babette de Fluiter, Hans L. Bodlaender
• Keywords: Parallel Algorithm, Path Decomposition, Series Parallel Graphs, Theoretical Computer Science, WG 1997