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

by L Roditty, U Zwick
Venue:In Proceedings of the 36 annual ACM symposium on Theory of computing (STOC