8 citations · 8 across the 1 of their papers we have counts for
1 paper
Ulrich Meyer
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 mon…