External memory BFS on undirected graphs with bounded degree

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 87-88

  Meyer, Ulrich ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Algorithms; Performance; Theory

Indexed keywords

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

References (6)

1. Alok Aggarwal, Jeffrey, S. Vitter, The input/output complexity of sorting and related problems, Communications of the ACM, v.31 n.9, p.1116-1127, Sept. 1988 [doi〉10.1145/48529.48535]
2. Lars Arge, Gerth Stølting Brodai, Laura Toma, On External-Memory MST, SSSP, and Multiway Planar Graph Separation, Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, p.433-447, July 05-07, 2000
3. 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
4. Kameshwar Munagala, Abhiram Ranade, I/O-complexity of graph algorithms, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.687-694, January 17-19, 1999, Baltimore, Maryland, United States
5. M. H. Nodine, M. T. Goodrich, and J. S. Vitter. Blocking for external graph searching. Algorithmica, 16(2):181-214, 1996.
6. J. S. Vitter. External memory algorithms and data structures: Dealing with MASSIVE DATA. Online Version: http://www.es.duke.eda/jav/,2000.