Efficient algorithms for combinatorial problems on graphs with bounded decomposability- a survey (0)

by S Arnborg
Venue:214 STEFAN ARNBORG AND ANDRZEJ PROSKUROWSKI