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)

• Type: Journal
• Year: 2008
• Where: CORR
• Authors: Ulrich Meyer
• Keywords: CORR 2008, Dynamic Breadth-first Search, Education, General Sparse, Sparse Undirected Graphs