Dynamic Breadth First Search with Predictions

Abstract

Given a graph $G(V,E)$ having $n$ vertices and $m$ edges, we maintain its Breadth-First Search (BFS) tree from source $s$ under an online sequence of edge updates in the prediction model. Our approach leverages a predicted update sequence aiding online processing. We present algorithms for incremental (insertions-only), decremental (deletions-only), and fully dynamic (insertions and deletions) settings that maintain a BFS tree (parent and level information). Classically, the incremental and decremental BFS tree requires total $O(mn)$ time [JACM81], with amortized $O(n)$ and worst-case $O(m)$ update time. The combinatorial BMM conjecture restricts any polynomial improvement [FOCS14] even when the updates are known in advance [STOC15]. For fully dynamic BFS trees, only the trivial $O(m)$ time recomputation is known. Our complexity bounds are expressed in prediction error measures, where error vertices are those having incorrectly predicted distances, with the corresponding difference as their error. The vertex prediction error $\eta_{v}$ is the sum of degrees of error vertices, weighted vertex prediction error $\eta^*_{v}$ is error-weighted sum of degrees of error vertices, and $\eta_e$ counts the incorrectly predicted updates. For incremental and decremental BFS, our algorithm requires respectively $O(\eta_v + \eta_e)$ and $O(\min\{m,\eta^*_v + \eta_e\})$ worst case update time using $O(mn)$ preprocessing time and space, and total update time of $O(\eta^*_v + \eta_e)$. For fully-dynamic updates, our algorithm requires $O(\min\{m,\eta^*_v+\eta_e\})$ worst case update time. At its core, we extend the classical ES Trees [JACM81] for batch updates and fully dynamic updates. This simple extension is sufficient to give a competitive prediction algorithm, which may be generalized to other graph problems. We also consider space optimizations and error correction to improve our results.