I/O-efficient algorithms for graphs of bounded treewidth (0)

by A Maheshwari, N Zeh
Venue:In Proc. 12th Ann. Symp. on Discrete Algorithms