I/O-efficient algorithms for graphs of bounded treewidth.

Anil Maheshwari, Norbert Zeh

Browse the full SODA paper archive.