I/O-Efficient Algorithms for Graphs of Bounded Treewidth

@article{Maheshwari2001IOEfficientAF,
  title={I/O-Efficient Algorithms for Graphs of Bounded Treewidth},
  author={Anil Maheshwari and Norbert Zeh},
  journal={Algorithmica},
  year={2001},
  volume={54},
  pages={413-469}
}
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. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 10 references

I/O-Efficient Algorithms for Shortest Path Related Problems

  • N. Zeh
  • PhD thesis, School of Computer Science, Carleton…
  • 2002
Highly Influential
5 Excerpts

and B

  • H. L. Bodlaende
  • de Fluiter. Parallel algorithms for series…
  • 1997
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…