## On External Memory MST, SSSP and Multi-way Planar Graph Separation (Extended Abstract) (2000)

Citations: | 33 - 11 self |

### BibTeX

@MISC{Arge00onexternal,

author = {Lars Arge and Gerth Stølting Brodal and Laura Toma},

title = {On External Memory MST, SSSP and Multi-way Planar Graph Separation (Extended Abstract)},

year = {2000}

}

### Years of Citing Articles

### OpenURL

### Abstract

Recently external memory graph algorithms 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. In this paper we develop improved algorithms for the problem of computing a minimum spanning tree of a general graph G = (V; E), as well as new algorithms for the single source shortest paths and the multi-way graph separation problems on planar graphs.