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

by Anil Maheshwari , Norbert Zeh
Venue:In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’2001
Citations:15 - 5 self