Abstract
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update can change all edges incident to a node.
The basic queries on reachability and distances should be answered in constant time, but also paths should be produced in time proportional to their length. For:
-
Transitive closure of Demetrescu and Italiano (FOCS 2000) Space reduction from O(n3) to O(n2), preserving an amortized update time of O(n2).
-
Exact all-pairs shortest dipaths of King (FOCS 1999) Space reduction from Ō(n3) to Ō(n2vnb), preserving an amortized update time of Ō(n2vnb), where b is the maximal edge weight.
-
Approximate all-pairs shortest dipaths of King (FOCS 1999) Space reduction from Ō(n3) to Ō(n2), preserving an amortized update time of Ō(n2).
Several authors (Demetrescu and Italiano, FOCS 2000, and Brown and King, Oberwolfach 2000) had discovered techniques to give a corresponding space reduction, but these techniques could be used to show only the existence of a desired dipath, and could not be used to produce the actual path.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
N. Alon, Z. Galil, O. Margalit, and M. Naor Witnesses for boolean matrix multiplication and for shortest paths. In Proceedings of the 33rd IEEE Annual Symposium on Foundations of Computer Science, pages 417–426, 1992.
G. Brown and V. King Space-efficent methods for maintaining shortest paths and transitive closure: Theory and practice, August 2000. Presentation at Workshop on Efficient Algorithms at Oberwolfach.
C. Demetrescu Fully Dynamic Algorithms for Path Problems on Directed Graphs. PhD thesis, Dip. Informatica e Sistemistica Universita’ di Roma “La Sapienza”, 2000.
C. Demetrescu and G. Italiano Fully dynamic transitive closure: Breaking through the o(n 2) barrier. In Proc. 41st IEEE Symp. on Foundations of Computer Science, pages 381–389, 2000.
S. Even and Y. Shiloach An on-line edge-deletion problem. J. ACM, 28(1):1–4, 1981.
Bernard Fortz and Mikkel Thorup Internet traffic engineering by optimizing OSPF weights. In Proc. 19th IEEE INFOCOM-The Conference on Computer Communications, pages 519–528, 2000.
D. Frigioni, M. Ioffreda, U. Nanni, and G. Pasqualone Experimental analysis of dynamic algorithms for the single-source shortest path problem. ACM Jounal of Experimental Algorithmics, 3, article 5, 1998.
M.E. Furman Application of a method of rapid multiplication of matrices to the problem of finding the transitive closure of a graph. Soviet Math. Dokl., 11(5):1250, 1970.
V. King Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs. In Proc. 40th IEEE Symp. on Foundations of Computer Science, pages 81–89, 1999.
I. Munro Efficient determination of the transitive closure of a directed graph. Information Processing Letters, 1(2):56–58, 1971.
G. Ramalingam and T.W. Reps An incremental algorithm for a generalization of the shortest-path problem. Journal of Algorithms, 21(2):267–305, 1996.
R.E. Tarjan Deep-first search and linear graph algorithms. SIAM J. Computing, 1:146–160, 1972.
U. Zwick All pairs shortest paths in weighted directed graphs-exact and almost exact algorithms. In Proceedings of the 39rd IEEE Annual Symposium on Foundations of Computer Science, pages 310–319, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
King, V., Thorup, M. (2001). A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms. In: Wang, J. (eds) Computing and Combinatorics. COCOON 2001. Lecture Notes in Computer Science, vol 2108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44679-6_30
Download citation
DOI: https://doi.org/10.1007/3-540-44679-6_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42494-9
Online ISBN: 978-3-540-44679-8
eBook Packages: Springer Book Archive