by Sublinear I/o, Kurt Mehlhorn, Ulrich Meyer
http://www.mpi-sb.mpg.de/~umeyer/dps/mehmey1.ps.gz
Add To MetaCart
Abstract:
Abstract. Breadth-first search (BFS) is a basic graph exploration technique. We give the first external memory algorithm for sparse undirected graphs with sublinear I/O. The best previous algorithm requires (n + n+m
Citations
|
389
|
The Input/Output complexity of sorting and related problems
– Aggarwal, Vitter
- 1988
|
|
245
|
Algorithms for parallel memory I: Two-level memories. Algorithmica
– Vitter, Shriver
- 1994
|
|
76
|
A functional approach to external graph algorithms
– Abello, Bushsbaum, et al.
- 1998
|
|
60
|
Improved algorithms and data structures for solving graph problems in external memory
– Kumar, Schwabe
- 1996
|
|
52
|
I/O-complexity of graph algorithms
– Munagala, Ranade
- 1999
|
|
37
|
On External Memory Graph Traversal
– Buchsbaum, Goldwasser, et al.
- 2000
|
|
24
|
I/o-efficient algorithms for problems on grid-based terrains
– Arge, Toma, et al.
- 2000
|
|
19
|
External memory graph algorithms
– Chiang, Goodrich, et al.
- 1995
|
|
18
|
External memory algorithms for outerplanar graphs
– Maheshwari, Zeh
- 1999
|
|
16
|
Greed sort: An optimal sorting algorithm for multiple disks
– Nodine, Vitter
- 1995
|
|
15
|
On external-memory planar depth first search
– Arge, Meyer, et al.
- 2001
|
|
14
|
I/O-efficient algorithms for graphs of bounded treewidth
– Maheshwari, Zeh
- 1999
|
|
13
|
Finding Euler tours in parallel
– Atallah, Vishkin
- 1984
|
|
13
|
I/O-optimal algorithms for planar graphs using separators
– Maheshwari, Zeh
- 2002
|
|
13
|
External memory BFS on undirected graphs with bounded degree
– Meyer
- 2001
|
|
12
|
On external-memory MST, SSSP and multi-way planar graph separation
– Arge, Brodal, et al.
- 2000
|
