Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs (1999)

by V King
Venue:in: Proc. 40th IEEE Symposium on Foundations of Computer Science (FOCS’99