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

Liam Roditty, Uri Zwick. A fully dynamic reachability algorithm for directed graphs with an almost linear update time. In László Babai, editor, Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004. pages 184-191, ACM, 2004. [doi]

Possibly Related Publications

The following publications are possibly variants of this publication: