Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs | IEEE Conference Publication | IEEE Xplore