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

by V King
Venue:In the Proceedings of the 40th Annual Symposium on Foundations of Computer Science