Efficient Parallel Algorithms for Graphs of Bounded Tree-Width.

Jens Lagergren Efficient Parallel Algorithms for Graphs of Bounded Tree-Width. 20-44 1996 20 J. Algorithms 1 db/journals/jal/jal20.html#Lagergren96