A fully dynamic reachability algorithm for directed graphs with an almost linear update time (2004)

by Liam Roditty, Uri Zwick
Venue:In Proc. 36th ACM Symposium on Theory of Computing (STOC