External-memory Breadth-first search with sublinear I/O

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2461, Issue , 2002, Pages 723-735

  Mehlhorn, Kurt ^a   Meyer, Ulrich ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BREADTH-FIRST SEARCH; EULERIAN GRAPHS; EXTERNAL MEMORY; EXTERNAL MEMORY ALGORITHMS; NEW APPROACHES; PARALLEL DISKS; SINGLE SOURCE SHORTEST PATHS; UNDIRECTED GRAPH;

DIRECTED GRAPHS;

EID: 84938077404     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45749-6_63     Document Type: Conference Paper

References (16)

1. J. Abello, A. Buchsbaum, and J. Westbrook. A functional approach to external graph algorithms. Algorithmica, 32(3):437-458, 2002. 724, 727
2. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Communications of the ACM, 3l(9):1116-1127, 1988. 724
3. L. Arge, G. Brodal, and L. Toma. On external-memory MST, SSSP and multi-way planar graph separation. In Proc. 8th Scand. Workshop on Algorithmic Theory, volume 1851 of LNCS, pages 433-447. Springer, 2000. 724, 730
4. L. Arge, U. Meyer, L. Toma, and N. Zeh. On external-memory planar depth first search. In Proc. 7th Intern. Workshop on Algorithms and Data Structures (WADS 2001), volume 2125 of LNCS, pages 471-482. Springer, 2001. 724
5. L. Arge, L. Toma, and J. S. Vitter. I/O-efficient algorithms for problems on grid-based terrains. In Proc. Workshop on Algorithm Engeneering and Experiments (ALENEX), 2000. 724
6. M. Atallah and U. Vishkin. Finding Euler tours in parallel. Journal of Computer and System Sciences, 29(30):330-337, 1984. 732
7. A. Buchsbaum, M. Goldwasser, S. Venkatasubramanian, and J. Westbrook. On external memory graph traversal. In Proc. 11th Symp. on Discrete Algorithms, pages 859-860. ACM-SIAM, 2000. 724, 726
8. Chiang, M. T. Goodrich, E. F. Grove, R. Tamasia, D. E. Vengroff, and J. S. Vitter. External memory graph algorithms. In 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 139-149, 1995. 724, 725, 730, 732, 733
9. V. Kumar and E. J. Schwabe. Improved algorithms and data structures for solving graph problems in external memory. In Proc. 8th Symp. on Parallel and Distrib. Processing, pages 169-177. IEEE, 1996. 724
10. A. Maheshwari and N. Zeh. External memory algorithms for outerplanar graphs. In Proc. 10th Intern. Symp. on Algorithms and Computations, volume 1741 of LNCS, pages 307-316. Springer, 1999. 724
11. A. Maheshwari and N. Zeh. I/O-efficient algorithms for graphs of bounded treewidth. In Proc. 12th Ann. Symp. on Discrete Algorithms, pages 89-90. ACM-SIAM, 2001. 724
12. A. Maheshwari and N. Zeh. I/O-optimal algorithms for planar graphs using separators. In Proc. 13th Ann. Symp. on Discrete Algorithms, pages 372-381. ACM-SIAM, 2002. 724, 725
13. U. Meyer. External memory BFS on undirected graphs with bounded degree. In Proc. 12th Ann. Symp. on Discrete Algorithms, pages 87-88. ACM-SIAM, 2001. 724
14. K. Munagala and A. Ranade. I/O-complexity of graph algorithms. In Proc. 10th Symp. on Discrete Algorithms, pages 687-694. ACM-SIAM, 1999. 724, 725, 726, 727, 730
15. M. H. Nodine and J. S. Vitter. Greed sort: An optimal sorting algorithm for multiple disks. Journal of the ACM, 42(4):919-933, 1995. 724
16. J. S. Vitter and E. A. M. Shriver. Algorithms for parallel memory I: Two level memories. Algorithmica, 12(2-3):110-147, 1994. 723