Efficient Parallel Algorithms for Graphs of Bounded Tree-Width

• 31 January 1996
• journal article
• Published by Elsevier in Journal of Algorithms
• Vol. 20  (1) , 20-44
• https://doi.org/10.1006/jagm.1996.0002

Abstract

Keywords

• ALGORITHMS FOR GRAPHS
• TREE WIDTH
• BOUNDED TREE
• EFFICIENT PARALLEL ALGORITHMS