A fully dynamic algorithm for maintaining the transitive closure

Journal of Computer and System Sciences

Volumn 65, Issue 1, 2002, Pages 150-167

  King, Valerie ^a   Sagert, Garry ^a  

^a UNIVERSITY OF VICTORIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; GRAPH THEORY; MATRIX ALGEBRA; OPTIMIZATION; PROBLEM SOLVING;

ACYCLIC GRAPHS; DYNAMIC ALGORITHMS; SPACE COMPLEXITY; TRANSITIVE CLOSURE;

ALGORITHMS;

EID: 23844435717     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1006/jcss.2002.1883     Document Type: Conference Paper

References (20)

1. E. Cohen, Size-estimation framework with applications to transitive closure and reachability, J. Comput. System Sci. 55 (1997), 441-453.
2. D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, J. Symbolic Comput. 9(1990), 251-280.
3. T. Cormen, C. Leiserson, and R. Rivest, "Introduction to Algorithms," MIT Press, Cambridge, MA, 1990.
4. S. Even and Y. Shiloach, An on-line edge-deletion problem, J. Assoc. Comput. Mach. 28 (1981), 1-4.
5. J. Feigenbaum and S. Kannan, Dynamic graph algorithms, in "Handbook of Discrete and Combinatorial Mathematics," pp. 583-591.
6. M. L. Fredman and M. Rauch Henzinger, Lower bounds for fully dynamic connectivity problems in graphs, Algorithmica 22 (1998), 351-362.
7. M. R. Henzinger and V. King, Fully dynamic biconnectivity and transitive closure, in "Proc. 36th Symp. on Foundations of Computer Science (FOCS)," 1995, pp. 664-672.
8. J. Holm, K. de Lichtenberg, and M. Thorup, Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity, in "Proc. 30th Symp. on Theory of Computing (STOC)," 1998, pp. 79-89.
9. M. R. Henzinger and M. Thorup, Sampling to provide or to bound: With applications to fully dynamic graph algorithms, Random Structures Algorithms 11 (1997), 369-379.
10. X. Huang and V. Y. Pan, Fast rectangular matrix multiplication and applications, J. Complexity 14 (1998), 257-299.
11. T. Ibaraki and N. Katoh, On-line computation of transitive closure of graphs, Inform. Process. Lett. (1983), 95-97.
12. G. F. Italiano, Amortized efficiency of a path retrieval data structure, Theoret. Comput. Sci. 48 (1986), 273-281.
13. G. F. Italiano, Finding paths and deleting edges in directed acyclic graphs, Inform. Process. Lett. (1988), 5-11.
14. S. Khanna, R. Motwani, and R. Wilson, Graph certificates and lookahead in dynamic directed graph problems, with applications, in "Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms," 1996.
15. D. Kozen, "The Design and Analysis of Algorithms," Springer-Verlag, pp. 26-27, Berlin/New York, 1992.
16. P. B. Miltersen, S. Subramanian, J. S. Vitter, and R. Tamassia, Complexity models for incremental computation, Theoret. Comput. Sci. 130 (1994), 202-236.
17. H. La Poutré and J. van Leeuwen, Maintenance of transitive closure and transitive reduction of graph, in "Proc. Workshop on Graph-Theoretic Concepts in Computer Science," Lecture Notes in Computer Science, Vol. 314, pp. 106-120, Springer-Verlag, Berlin, 1987.
18. V. Strassen, Gaussian elimination is not optimal, Numer. Math. 14 (1969), 354-356.
19. R. E. Tarjan, Depth first search and linear graph algorithms, SIAM J. Comput. 1 (1972), 146-160.
20. D. M. Yellin, Speeding up dynamic transitive closure for bounded degree graphs, Acta Inform. 30 (1993), 369-384.