On external memory graph traversal

  title={On external memory graph traversal},
  author={Adam L. Buchsbaum and Michael H. Goldwasser and Suresh Venkatasubramanian and Jeffery Westbrook},
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) an d improved external algorithm for directed depth-first searc h. We also demonstrate the equivalence of various formulations of ext ernal undirected BFS, and we use these to give the first I/O-optimal BFS algorithm for undirected trees. 
Highly Influential
This paper has highly influenced 11 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 125 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 83 extracted citations

Write-Optimized Skip Lists

View 19 Excerpts
Highly Influenced

BetrFS: Write-Optimization in a Kernel File System

TOS • 2015
View 6 Excerpts
Highly Influenced

Divide & Conquer: I/O Efficient Depth-First Search

SIGMOD Conference • 2015
View 17 Excerpts
Highly Influenced

Contract & Expand: I/O Efficient SCCs Computing

2014 IEEE 30th International Conference on Data Engineering • 2014
View 8 Excerpts
Highly Influenced

Cache-oblivious streaming B-trees

View 12 Excerpts
Highly Influenced

125 Citations

Citations per Year
Semantic Scholar estimates that this publication has 125 citations based on the available data.

See our FAQ for additional information.


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

Similar Papers

Loading similar papers…