I/O-efficient algorithms for graphs of bounded treewidth
We present I/O-efficient algorithms for the single source shortest path problem and NP-hard problems on graphs of bounded treewidth. The main step in these algorithms is a method to compute a tree-decomposition for the given graph I/O-efficiently. Copyright
|2001 Operating Section Proceedings, American Gas Association|
Maheshwari, A, & Zeh, N. (Norbert). (2001). I/O-efficient algorithms for graphs of bounded treewidth. Presented at the 2001 Operating Section Proceedings, American Gas Association.