Parallel Algorithms with Optimal Speedup for Bounded Treewidth

We describe the rst parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algorithm works in Ologn2 time using On operations on the EREW PRAM. We also give faster parallel algorithms with optimal speedup for the problem of deciding whether the treewidth of an input graph is bounded by a given constant and for a variety of problems on graphs of bounded treewidth, including all decision problems expressible in monadic second-order logic. On n-vertex input graphs, the algorithms use On operations together with Olognlogn time on the EREW PRAM, or Ologn time on the CRCW PRAM.

• Type: Conference
• Year: 1995
• Where: ICALP
• Authors: Hans L. Bodlaender, Torben Hagerup
• Keywords: EREW PRAM, ICALP 1995, Input Graphs, Optimal Speedup, Programming Languages