(Enter summary)
Abstract: We give the rst external memory algorithm for breadth-rst
search (BFS) which achieves o(n) I/Os on arbitrary undirected
graphs with n nodes and maximum node degree d. Let M
and B > d denote the main memory size and block size,
respectively. Using Sort(x) = (
x
B
log M=B
x
B
), our algorithm
needs O(
n
log d B
+ Sort(n B
)) I/Os and O(n B
) external
space for an arbitrary parameter 0 < 1=2. The result carries
over to BFS, depth-rst search (DFS) and single source... (Update)
Context of citations to this paper: More
...They also showed how to use their structure in several efficient external graph algorithms (see e. g [2, 7, 18, 22, 27, 46, 59, 81, 97, 107, 110, 111, 116, 118, 122, 142, 156] for other results on external graph algorithms and data structures) Note that if the priority of an...
...respectively [32] 1. 2 Previous Results I O efficient graph algorithms have been studied in a number of papers [1, 2, 4, 5, 9, 11, 17, 20, 22, 23, 25, 27, 31]. We only discuss results on undirected BFS, DFS, single source shortest paths, planar embedding, and graph...
Cited by: More
On External-Memory Planar Depth-First Search - Arge, Meyer, Toma, Zeh (2003)
(Correct)
External-Memory Breadth-First Search with Sublinear I/O - Mehlhorn, Meyer (2002)
(Correct)
I/O-Efficient Algorithms for Graphs of Bounded Treewidth - Maheshwari, Zeh (2000)
(Correct)
Active bibliography (related documents): More All
0.2: External Memory Data Structures - Arge (2000)
(Correct)
0.2: Unknown - Brodal Et Al
(Correct)
0.2: Cache-Oblivious Priority Queue and Graph Algorithm.. - Arge, Bender.. (2002)
(Correct)
Similar documents based on text: More All
0.7: On External Memory MST, SSSP and Multi-way Planar Graph.. - Arge, al.
(Correct)
0.2: Remembrance of Things Past: Locality and Memory in BDDs - Manne, Grunwald, Somenzi (1997)
(Correct)
0.2: The Nature of Breadth-First Search - Holdsworth (1999)
(Correct)
Related documents from co-citation: More All
7: External-memory graph algorithms
- Chiang, Goodrich et al. - 1995
7: Improved algorithms and data structures for solving graph problems in external m..
- Kumar, Schwabe - 1996
6: complexity of graph algorithms (context) - Kameshwar, Ranade et al. - 1999
BibTeX entry: (Update)
U. Meyer. External memory bfs on undirected graphs with bounded degree. In Proc. ACM-SIAM Symp. on Discrete Algorithms, pages 87--88, 2001. http://citeseer.ist.psu.edu/meyer01external.html More
@inproceedings{ meyer01external,
author = "Ulrich Meyer",
title = "External memory {BFS} on undirected graphs with bounded degree",
booktitle = "Symposium on Discrete Algorithms",
pages = "87-88",
year = "2001",
url = "citeseer.ist.psu.edu/meyer01external.html" }
Citations (may not include all citations):
113
output complexity of sorting and related problems (context) - Aggarwal, Vitter - 1988
59
External memory algorithms and data structures: Dealing with..
- Vitter - 2000
41
Blocking for external graph searching
- Nodine, Goodrich et al. - 1996
40
Improved algorithms and data structures for solving graph pr..
- Kumar, Schwabe - 1996
26
complexity of graph algorithms (context) - Munagala, Ranade et al. - 1999
7
SSSP and multi-way planar graph separation (context) - Arge, Brodal et al. - 2000
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.mpi-sb.mpg.de/~umeyer/pubs.html): More
Towards Practical Permutation Routing on Meshes - Kaufmann, Meyer, Sibeyn (1994)
(Correct)
Matrix Transpose on Meshes: Theory and Practice - Kaufmann, Meyer, Sibeyn (1997)
(Correct)
Matrix Transpose on Meshes: Theory and Practice - Kaufmann, Meyer, Sibeyn (1997)
(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