On Dynamic Breadth-First Search in External-Memory
| dc.creator | Meyer, Ulrich | |
| dc.date | 2008-02-20 | |
| dc.date.accessioned | 2026-07-07T09:22:02Z | |
| dc.date.available | 2026-07-07T09:22:02Z | |
| dc.description | 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/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 $Ω(n/B^{1/2}+\sort(n))$ I/Os. | |
| dc.identifier | https://arxiv.org/abs/0802.2847 | |
| dc.identifier | http://arxiv.org/abs/0802.2847 | |
| dc.identifier | Dans Proceedings of the 25th Annual Symposium on the Theoretical Aspects of Computer Science - STACS 2008, Bordeaux : France (2008) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/155235 | |
| dc.subject | Data Structures and Algorithms | |
| dc.title | On Dynamic Breadth-First Search in External-Memory | |
| dc.type | text |