External-Memory Graph Algorithms

External-Memory Graph Algorithms (1995)

by Yi-Jen Chiang , Michael T. Goodrich , Edward F. Grove , Roberto Tamassia , Darren Erik Vengroff , Jeffrey Scott Vitter

Citations:

User correction supplied by mph

Datum	Value	Source
TITLE	External-Memory Graph Algorithms	user correction - Legacy Corrections
AUTHOR NAME	Yi-Jen Chiang	user correction
AUTHOR NAME	Michael T. Goodrich	user correction
AUTHOR NAME	Edward F. Grove	user correction
AUTHOR NAME	Roberto Tamassia	user correction
AUTHOR NAME	Darren Erik Vengroff	user correction
AUTHOR NAME	Jeffrey Scott Vitter	user correction
ABSTRACT	We present a collection of new techniques for designing and analyzing efficient external-memory algorithms for graph problems and illustrate how these techniques can be applied to a wide variety of specific problems. Our results include: ffl Proximate-neighboring. We present a simple method for deriving external-memory lower bounds via reductions from a problem we call the "proximate neighbors" problem. We use this technique to derive non-trivial lower bounds for such problems as list ranking, expression tree evaluation, and connected components. ffl PRAM simulation. We give methods for efficiently simulating PRAM computations in external memory, even for some cases in which the PRAM algorithm is not work-optimal. We apply this to derive a number of optimal (and simple) external-memory graph algorithms. ffl Time-forward processing. We present a general technique for evaluating circuits (or "circuit-like" computations) in external memory. We also use this in a deterministic list rank...	user correction - Legacy Corrections
YEAR	1995	user correction - Legacy Corrections
CITATIONS	27 found	ParsCit 1.0