(Enter summary)
Abstract: 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.
1 Introduction
We use the standard I/O model [1], which counts disk... (Update)
Context of citations to this paper: More
...SSSP, BFS, and topological sorting all perform C(V) I Os. More precisely, their I O complexity is O(min (V ) log V sort(E) V ) [5, 6, 13]. A number of improved algorithms have been developed for special classes of graphs. For trees for example, O(sort(N) I O...
Cited by: More
Unknown - Brodal Et Al
(Correct)
Fast PageRank Computation via a Sparse Linear System.. - Corso, Gullí..
(Correct)
Exploiting Web Matrix Permutations to Speedup PageRank.. - Corso, Gulli, Romani (2004)
(Correct)
Active bibliography (related documents): More All
0.0: On External Memory Graph Traversal - Buchsbaum, Goldwasser.. (2000)
(Correct)
0.0: On External-Memory MST, SSSP and Multi-way Planar Graph.. - Arge, Brodal, al. (2000)
(Correct)
0.0: I/O-Efficient Algorithms for Problems on Grid-based Terrains.. - Arge, al.
(Correct)
Similar documents based on text: More All
0.9: On External Memory MST, SSSP and Multi-way Planar Graph.. - Arge, al.
(Correct)
0.4: External-Memory Breadth-First Search with Sublinear I/O - Mehlhorn, Meyer (2002)
(Correct)
0.2: A Gimmick to Integrate Software Testing Throughout the Curriculum - Goldwasser (2002)
(Correct)
Related documents from co-citation: More All
11: Improved algorithms and data structures for solving graph problems in external m..
- Kumar, Schwabe - 1996
11: External-memory graph algorithms
- Chiang, Goodrich et al. - 1995
10: complexity of graph algorithms (context) - Kameshwar, Ranade et al. - 1999
BibTeX entry: (Update)
A. L. Buchsbaum, M. Goldwasser, S. Venkatasubramanian, and J. R. Westbrook. On external memory graph traversal. In Proc. ACM-SIAM Symp. on Discrete Algorithms, 2000. (to appear). http://citeseer.ist.psu.edu/article/buchsbaum00external.html More
@inproceedings{ buchsbaum00external,
author = "Adam L. Buchsbaum and Michael Goldwasser and Suresh Venkatasubramanian and Jeffery Westbrook",
title = "On external memory graph traversal",
booktitle = "Symposium on Discrete Algorithms",
pages = "859-860",
year = "2000",
url = "citeseer.ist.psu.edu/article/buchsbaum00external.html" }
Citations (may not include all citations):
3972
Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1991
113
output complexity of sorting and related problems (context) - Aggarwal, Vitter - 1988
107
External-memory graph algorithms
- Chiang, Goodrich et al. - 1995
60
The buffer tree: A new technique for optimal I/O algorithms (context) - Arge - 1995
40
Improved algorithms and data structures for solving graph pr..
- Kumar, Schwabe - 1996
26
complexity of graph algorithms (context) - Kameshwar, Ranade et al. - 1999
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.research.att.com/~suresh/plist.html): More
Energy-Efficient Indexing For Information.. - Shivakumar.. (1996)
(Correct)
Approximate Congruence in Nearly Linear Time - Piotr Indyk Suresh (2000)
(Correct)
Geometric Pattern Matching: A Performance Study - Gavrilov, Indyk, Motwani.. (1999)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC