## Parallel Algorithms with Optimal Speedup for Bounded Treewidth (1995)

### Cached

### Download Links

- [archive.cs.uu.nl]
- [www.cs.uu.nl]
- [www.cs.uu.nl]
- [igitur-archive.library.uu.nl]
- DBLP

### Other Repositories/Bibliography

Venue: | Proceedings 22nd International Colloquium on Automata, Languages and Programming |

Citations: | 32 - 10 self |

### BibTeX

@INPROCEEDINGS{Bodlaender95parallelalgorithms,

author = {Hans L. Bodlaender and Torben Hagerup},

title = {Parallel Algorithms with Optimal Speedup for Bounded Treewidth},

booktitle = {Proceedings 22nd International Colloquium on Automata, Languages and Programming},

year = {1995},

pages = {268--279},

publisher = {Springer-Verlag}

}

### Years of Citing Articles

### OpenURL

### Abstract

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((logn)^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 log n) time on the EREW PRAM, or O(log n) time on the CRCW PRAM.