Corpus ID: 1622245

External-memory graph algorithms

@inproceedings{Chiang1995ExternalmemoryGA,
  title={External-memory graph algorithms},
  author={Yi-Jen Chiang and M. Goodrich and E. Grove and R. Tamassia and D. E. Vengroff and J. Vitter},
  booktitle={SODA '95},
  year={1995}
}
We present a collection of new techniques for designing and analyzing e cient external-memory algorithms for graph problems and illustrate how these techniques can be applied to a wide variety of speci c problems. [...] Key Method We use this technique to derive non-trivial lower bounds for such problems as list ranking, expression tree evaluation, and connected components. PRAM simulation. We give methods for e ciently simulating PRAM computations in external memory, even for some cases in which the PRAM…Expand
Beyond Synchronous: New Techniques for External-Memory Graph Connectivity and Minimum Spanning Forest
Improved algorithms and data structures for solving graph problems in external memory
  • Vijay Kumar, E. Schwabe
  • Computer Science
  • Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing
  • 1996
I/O-Efficient Algorithms for Bounded Treewidth Graphs
Proposal : Disk-based Large-Scale Graph Computation on a Single Machine
External A*
An external-memory depth-first search algorithm for general grid graphs
On external-memory MST, SSSP and multi-way planar graph separation
A Heuristic Strong Connectivity Algorithm for Large Graphs
A Functional Approach to External Graph Algorithms
...
1
2
3
4
5
...

References

SHOWING 1-6 OF 6 REFERENCES
Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking
The input/output complexity of transitive closure
A Simple Randomized Parallel Algorithm for List-Ranking
The input/output com- plexity of sorting and related problems
  • Communica- tions of the ACM,
  • 1988
Finding biconnected compo- nents and computing tree functions in logarithmic par- allel time
  • SIAM J. Computing,
  • 1985