10 citations · 24 across the 9 of their papers we have counts for
1 paper · 1 filter
Kathrin Hanauer, Monika Henzinger, Christian Schulz
Given a directed graph and a source vertex, the fully dynamic single-source reachability problem is to maintain the set of vertices that are reachable from the given vertex, subjec…