Sciweavers

Share
SODA
2000
ACM

On external memory graph traversal

8 years 9 months ago
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.
Adam L. Buchsbaum, Michael H. Goldwasser, Suresh V
Added 01 Nov 2010
Updated 01 Nov 2010
Type Conference
Year 2000
Where SODA
Authors Adam L. Buchsbaum, Michael H. Goldwasser, Suresh Venkatasubramanian, Jeffery Westbrook
Comments (0)
books