I/O-efficient algorithms for graphs of bounded treewidth

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 89-90

  Maheshwari, Anil ^a   Zeh, Norbert ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

Algorithms; Performance; Theory

Indexed keywords

EID: 64049108504     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. James Abello, Adam L. Buchsbaum, Jeffery Westbrook, A Functional Approach to External Graph Algorithms, Proceedings of the 6th Annual European Symposium on Algorithms, p.332-343, August 24-26, 1998
2. Stefan Arnborg, Andrzej Proskurowski, Linear time algorithms for NP-hard problems restricted to partial k-trees, Discrete Applied Mathematics, v.23 n.1, p.11-24, April 1989 [doi〉10.1016/0166-218X(89)90031-0]
3. Hans L. Bodlaender, Dynamic Programming on Graphs with Bounded Treewidth, Proceedings of the 15th International Colloquium on Automata, Languages and Programming, p.105-118, July 11-15, 1988
4. Hans L. Bodlaender, A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth, SIAM Journal on Computing, v.25 n.6, p.1305-1317, Dec. 1996 [doi〉10.1137/S0097539793251219]
5. Hans L. Bodlaender, Ton Kloks, Efficient and constructive algorithms for the pathwidth and treewidth of graphs, Journal of Algorithms, v.21 n.2, p.358-402, Sept. 1996 [doi〉10.1006/jagm.1996.0049 ]
6. Yi-Jen Chiang, Michael T. Goodrich, Edward F. Grove, Roberto Tamassia, Darren Erik Vengroff, Jeffrey Scott Vitter, External-memory graph algorithms, Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms, p.139-149, January 22-24, 1995, San Francisco, California, United States
7. Vijay Kumar, Eric J. Schwabe, Improved Algorithms and Data Structures for Solving Graph Problems in External Memory, Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP '96), p.169, October 23-26, 1996
8. Anil Maheshwari, Norbert Zeh, External Memory Algorithms for Outerplanar Graphs, Proceedings of the 10th International Symposium on Algorithms and Computation, p.307-316, December 16-18, 1999
9. Ulrich Meyer, External memory BFS on undirected graphs with bounded degree, Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, p.87-88, January 07-09, 2001, Washington, D.C., United States
10. Jeffrey Scott Vitter, External memory algorithms and data structures, External memory algorithms, American Mathematical Society, Boston, MA, 1999