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

by L Roditty, U Zwick
Venue:In Proc. 36th Annual ACM Symposium on Theory of Computing (STOC ’04