Finding Euler tours in parallel
Journal of Computer and System Sciences
The input/output complexity of sorting and related problems
Communications of the ACM
Greed sort: optimal deterministic sorting on parallel disks
Journal of the ACM (JACM)
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
On external memory graph traversal
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
External memory BFS on undirected graphs with bounded degree
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
I/O-efficient algorithms for graphs of bounded treewidth
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
I/O-optimal algorithms for planar graphs using separators
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On External-Memory MST, SSSP, and Multi-way Planar Graph Separation
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
On External-Memory Planar Depth First Search
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
External Memory Algorithms for Outerplanar Graphs
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
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 topological sorting of planar DAGs
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Route planning and map inference with global positioning traces
Computer Science in Perspective
On external-memory MST, SSSP and multi-way planar graph separation
Journal of Algorithms
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
Using web-graph distance for relevance feedback in web search
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
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
Terracost: Computing least-cost-path surfaces for massive grid terrains
Journal of Experimental Algorithmics (JEA)
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
Semi-external LTL Model Checking
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
On Trade-Offs in External-Memory Diameter-Approximation
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Linear-time disk-based implicit graph search
Journal of the ACM (JACM)
On Computational Models for Flash Memory Devices
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
A Heuristic Strong Connectivity Algorithm for Large Graphs
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Design and Engineering of External Memory Traversal Algorithms for General Graphs
Algorithmics of Large and Complex Networks
Structured duplicate detection in external-memory graph search
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
External-memory pattern databases using structured duplicate detection
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
I/O efficient accepting cycle detection
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Characterizing the performance of flash memory storage devices and its impact on algorithm design
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
External-memory algorithms and data structures
Algorithms and theory of computation handbook
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
Finding the diameter in real-world graphs experimentally turning a lower bound into an upper bound
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
A comparison of three algorithms for approximating the distance distribution in real-world graphs
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
External memory breadth-first search with delayed duplicate detection on the GPU
MoChArt'10 Proceedings of the 6th international conference on Model checking and artificial intelligence
I/O-efficient data structures for colored range and prefix reporting
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete 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
Efficient processing of distance queries in large graphs: a vertex cover approach
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths
ACM Transactions on Algorithms (TALG)
Efficient reachability query evaluation in large spatiotemporal contact datasets
Proceedings of the VLDB Endowment
On computing the diameter of real-world directed (weighted) graphs
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
I/O-efficient hierarchical diameter approximation
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
I/O efficient: computing SCCs in massive graphs
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Exploring the future of out-of-core computing with compute-local non-volatile memory
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
IS-Label: an independent-set based labeling scheme for point-to-point distance querying
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
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/D驴B 驴 logM/B n+m/B) I/Os on a graph with n nodes and m edges and a machine with main-memory of size M, D parallel disks, and block size B. We present a new approach which requires only O(驴n驴(n+m)/D驴B + n+m/D驴B 驴 logM/B n+m/B)I/Os. Hence, for m = O(n) and all realistic values of logM/B n+m/B, it improves upon the I/O-performance of the best previous algorithm by a factor 驴(驴D 驴 B). Our approach is fairly simple and we conjecture it to be practical. We also give improved algorithms for undirected single-source shortest-paths with small integer edge weights and for semi-external BFS on directed Eulerian graphs.