Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Parallel ear decomposition search (EDS) and st-numbering in graphs
Theoretical Computer Science
The input/output complexity of sorting and related problems
Communications of the ACM
Introduction to algorithms
A randomized linear-time algorithm to find minimum spanning trees
Journal of the ACM (JACM)
Random permutations on distributed, external and hierarchical memory
Information Processing Letters
External-memory graph algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
I/O-complexity of graph algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
On maximum clique problems in very large graphs
External memory algorithms
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
On external memory graph traversal
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A minimum spanning tree algorithm with inverse-Ackermann type complexity
Journal of the ACM (JACM)
An improved equivalence algorithm
Communications of the ACM
An optimal minimum spanning tree algorithm
Journal of the ACM (JACM)
Cache-oblivious priority queue and graph algorithm applications
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
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 MST, SSSP, and Multi-way Planar Graph Separation
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract)
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Cache Oblivious Distribution Sweeping
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Funnel Heap - A Cache Oblivious Priority Queue
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Implementing I/O-efficient Data Structures Using TPIE
ESA '02 Proceedings of the 10th 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
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
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)
Efficient Flow Computation on Massive Grid Terrain Datasets
Geoinformatica
A new approach to all-pairs shortest paths on real-weighted graphs
Theoretical Computer Science - Special issue on automata, languages and programming
External-memory exact and approximate all-pairs shortest-paths in undirected graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A computational study of external-memory BFS algorithms
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
I/O-efficient undirected shortest paths with unbounded edge lengths
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
STXXL: standard template library for XXL data sets
Software—Practice & Experience
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
STXXL: standard template library for XXL data sets
ESA'05 Proceedings of the 13th annual European conference on Algorithms
I/O efficient directed model checking
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Parallel external directed model checking with linear i/o
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Large-Scale directed model checking LTL
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Multithreaded Asynchronous Graph Traversal for In-Memory and Semi-External Memory
Proceedings of the 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis
Parallel breadth-first search on distributed memory systems
Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis
I/O efficient: computing SCCs in massive graphs
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
| Hi-index | 0.03 |
Large graphs arise naturally in many real world applications. The actual performance of simple RAM model algorithms for traversing these graphs (stored in external memory) deviates significantly from their linear or near-linear predicted performance because of the large number of I/Os they incur. In order to alleviate the I/O bottleneck, many external memory graph traversal algorithms have been designed with provable worst-case guarantees. We describe the various techniques used in the design and engineering of such algorithms and survey the state-of-the-art in I/O-efficient graph traversal algorithms.