On external memory graph traversal

We describe a new external memory data structure, the buffered repository tree, and use it to provide the first non-trivial external memory algorithm for directed breadth-first search (BFS) and an improved external algorithm for directed depth-first search. We also demonstrate the equivalence of various formulations of external undirected BFS, and we use these to give the first I/O-optimal BFS algorithm for undirected trees.

• Type: Conference
• Year: 2000
• Where: SODA
• Authors: Adam L. Buchsbaum, Michael H. Goldwasser, Suresh Venkatasubramanian, Jeffery Westbrook
• Keywords: Algorithms, External Memory, External Memory Algorithm, External Undirected Bfs, SODA 2000