MPI-I-95-1-017. July 1995, 27 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry
Abstract in LaTeX format:
We describe the first 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
$O((\log n)^2)$ time using $O(n)$ 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
$O(n)$ operations together with $O(\log n\Tlogstar n)$
time on the EREW PRAM, or $O(\log n)$ time on the CRCW PRAM.
References to related material:
|To download this research report, please select the type of document that fits best your needs.||Attachement Size(s):|
|Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView|