A faster and simpler fully dynamic transitive closure

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 404-412

  Roditty, Liam ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATRIX ALGEBRA; POLYNOMIALS; QUERY LANGUAGES; THEOREM PROVING;

DIRECTED ACYCLIC GRAPH; DYNAMIC ALGORITHM; REACHABILITY QUERIES; TRANSITIVE CLOSURE;

GRAPH THEORY;

EID: 0038416055     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. S. Baswana, R. Hariharan, and S. Sen. Improved decremental algorithms for transitive closure and all-pairs shortest paths. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing, Montréal, Québec, 2002.
2. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein. Introduction to algorithms. The MIT Press, second edition, 2001.
3. 2) barrier. In Proceedings of the 41th Annual IEEE Symposium on Foundations of Computer Science, Redondo Beach, California, pages 381-389, 2000.
4. D. Frigioni, T. Miller, U. Nanni, and C. Zaroliagis. An experimental study of dynamic algorithms for transitive closure. ACM Journal of Experimental Algorithmics, 6, 2001.
5. H.N. Gabow. Path-based depth-first search for strong and biconnected components. Information Processing Letters, 74(3-4):107-114, 2000.
6. G.F. Italiano. Amortized efficiency of a path retrieval data structure. Theoretical Computer Science, 48(3):273-281, 1986.
7. G.F. Italiano. Finding paths and deleting edges in directed acyclic graphs. Information Processing Letters, 28(1):5-11, 1988.
8. V. King. Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, New York, New York, pages 81-91, 1999.
9. V. King and G. Sagert. A fully dynamic algorithm for maintaining the transitive closure. In Proceedings of the 31th Annual ACM Symposium on Theory of Computing, Atlanta, Georgia, pages 492-498, 1999.
10. V. King and M. Thorup. A space saving trick for directed dynamic transitive closure and shortest path algorithms. In Proceedings of the 7th Annual International Computing and Combinatorics Conference, Guilin, China, pages 269-277, 2001.
11. J.A. La Poutré and J. van Leeuwen. Maintenance of transitive closure and transitive reduction of graphs. In Proceedings of the 13th International Workshop on Graph-Theoretic Concepts in Computer Science, Amsterdam, The Netherlands, volume 314, 1987.
12. L. Roditty and U. Zwick. Improved dynamic reachability algorithms for directed graphs. In Proceedings of the 43th Annual IEEE Symposium on Foundations of Computer Science, Vancouver, Canada, 2002.
13. M. Sharir. A strong-connectivity algorithm and its application in data flow analysis. Computers and Mathematics with Applications, 7(1):67-72, 1981.
14. R.E. Tarjan. Depth first search and linear graph algorithms. SIAM Journal on Computing, 11:146-159, 1982.