Sciweavers

Share
CORR
2008
Springer

On Dynamic Breadth-First Search in External-Memory

8 years 7 months ago
On Dynamic Breadth-First Search in External-Memory
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 (n) edge insertions or (n) edge deletions, we prove an amortized high-probability bound of O(n/B2/3 + sort(n)
Ulrich Meyer
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2008
Where CORR
Authors Ulrich Meyer
Comments (0)
books