Review
Towards Faster Parallel Algorithms for Tree Decompositions
This thesis surveys major algorithmic developments for computing treewidth and discusses the compression and improvement paradigm developed in the 1990s, especially in the work of Bodlaender and Kloks, and Bodlaender and Hagerup.
Taek-Yoon Kim, Chair Guy Blelloch, William Kuszmaul
· 0 citations