119
click to vote
ICALP
1995
Springer
15 years 6 months ago
1995
Springer
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 algori...