On Dynamic Breadth-First Search in External-Memory

Ulrich Meyer (1)

1 Institute for Computer Science

We provide the first non-trivial result on dynamic breadth-first search (BFS) in external-memory: For general sparse undirected graphs of initially $n$ nodes and $O(n)$ edges and monotone update sequences of either $\Theta(n)$ edge insertions or $\Theta(n)$ edge deletions, we prove an amortized high-probability bound of $O(n/B^{2/3}+\sort(n)\cdot \log B)$ I/Os per update. In contrast, the currently best approach for static BFS on sparse undirected graphs requires $\Omega(n/B^{1/2}+\sort(n))$ I/Os.

Mots clés: External Memory; Dynamic Graph Algorithms; BFS; Randomization

Domaines: Algorithme et structure de données [cs.DS]

Ulrich Meyer. On Dynamic Breadth-First Search in External-Memory. STACS 2008, Feb 2008, Bordeaux, France. pp.551-560. ⟨hal-00232975⟩