External-Memory Breadth-First Search with Sublinear I/O

  • Kurt Mehlhorn
  • Ulrich Meyer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2461)

Abstract

Breadth-first search (BFS) is a basic graph exploration technique. We give the first external memory algorithm for sparse undirected graphs with sublinear I/O. The best previous algorithm requires \( \Theta \left( {n + \tfrac{{n + m}} {{D \cdot B}} \cdot \log _{M/B} \tfrac{{n + m}} {B}} \right) \) I/Os on a graph with n nodes and m edges and a machine with main-memory of size M, D parallel disks, and block size B. We present a new approach which requires only \( \mathcal{O}(\sqrt {\tfrac{{n \cdot (n + m)}} {{D \cdot B}} + } \tfrac{{n + m}} {{D \cdot B}} \cdot \log _{M/B} \tfrac{{n + m}} {B}) \) I/Os. Hence, for \( \Omega \sqrt {D \cdot B} \) and all realistic values of \( m = \mathcal{O}(n) \), it improves upon the I/O-performance of the best previous algorithm by a factor \( \log _{M/B} \tfrac{{n + m}} {B}) \). Our approach is fairly simple and we conjecture it to be practical. We also give improved algorithms for undirected single-source shortest-paths with small integer edge weights and for semi-external BFS on directed Eulerian graphs.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Kurt Mehlhorn
    • 1
  • Ulrich Meyer
    • 1
  1. 1.Max-Planck-Institut für InformatikSaarbrückenGermany

Personalised recommendations