Summary: Chapter 1
External-Memory Graph Algorithms
Yi-Jen Chiangy
Michael T. Goodrichzx
Edward F. Grove k
Roberto Tamassiay
Darren Erik Vengro yy
Je rey Scott Vitter zz
Abstract
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. Our
results include:
Proximate-neighboring. We present a simple
method for deriving external-memory lower bounds
via reductions from a problem we call the proxi-
mate neighbors" problem. We use this technique to
derive non-trivial lower bounds for such problems
as list ranking, expression tree evaluation, and con-

Source: Arge, Lars - Department of Computer Science, Aarhus Universitet

Collections: Computer Technologies and Information Sciences