Efficient algorithms for combinatorial problems on graphs with bounded decomposability. A survey (1985)

by S Arnborg
Venue:BIT Numerical Mathematics