The input/output complexity of sorting and related problems
Communications of the ACM
I/O-complexity of graph algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Improved Algorithms and Data Structures for Solving Graph Problems in External Memory
SPDP '96 Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP '96)
I/O-efficient algorithms for graphs of bounded treewidth
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
I/O-optimal algorithms for planar graphs using separators
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Heuristics for semi-external depth first search on directed graphs
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
On External-Memory Planar Depth First Search
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
External Memory Data Structures
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
External-Memory Breadth-First Search with Sublinear I/O
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Handbook of massive data sets
External-memory depth-first search algorithm for solid grid graphs
Information Processing Letters
An external-memory depth-first search algorithm for general grid graphs
Theoretical Computer Science
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
Linear-time disk-based implicit graph search
Journal of the ACM (JACM)
External-memory depth-first search algorithm for solid grid graphs
Information Processing Letters
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
An effective GPU implementation of breadth-first search
Proceedings of the 47th Design Automation Conference
External-memory algorithms and data structures
Algorithms and theory of computation handbook
| Hi-index | 0.00 |
We give the first external memory algorithm for breadth-first search (BFS) which achieves &Ogr;(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) = &THgr;(x÷B · log M/B x÷B), our algorithm needs &Ogr;(n÷&ggr;·logdB + Sort(n · B&ggr;)) I/Os and &Ogr;(n · B&ggr;) external space for an arbitrary parameter 0