| | |
Summary: Journal of Algorithms 53 (2004) 186206
www.elsevier.com/locate/jalgor
On external-memory MST, SSSP and multi-way
planar graph separation
Lars Arge a,,1
, Gerth Stølting Brodal b,2
, Laura Toma a,1
a Department of Computer Science, Duke University, USA
b BRICS (Basic Research in Computer Science, Center of Danish National Research Foundation),
University of Aarhus, Denmark
Received 15 November 2002
Abstract
Recently external memory graph problems have received considerable attention because massive
graphs arise naturally in many applications involving massive data sets. Even though a large number
of I/O-efficient graph algorithms have been developed, a number of fundamental problems still
remain open.
The results in this paper fall in two main classes. First we develop an improved algorithm for
the problem of computing a minimum spanning tree (MST) of a general undirected graph. Second
we show that on planar undirected graphs the problems of computing a multi-way graph separation
and single source shortest paths (SSSP) can be reduced I/O-efficiently to planar breadth-first search
|
