Efficient Parallel Algorithms for Graphs of Bounded Tree-Width

Journal of Algorithms - Tập 20 - Trang 20-44 - 1996
Jens Lagergren1
1Royal Institute of Technology, NADA, KTH, S-100 44, Stockholm, Sweden