Improved dynamic reachability algorithms for directed graphs

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2002, Pages 679-688

  Roditty, Liam ^a   Zwick, Uri ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; DYNAMIC PROGRAMMING; GRAPH THEORY; MATRIX ALGEBRA; QUERY LANGUAGES; RANDOM PROCESSES; TIME DOMAIN ANALYSIS;

DIRECTED GRAPH; DYNAMIC REACHABILITY ALGORITHMS; QUERY TIME; REACHABILITY QUERY; TRANSITIVE CLOSURE MATRIX;

COMPUTER SCIENCE;

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

References (22)

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, Canada, pages 117-123, 2002.
2. S. Cicerone, D. Frgioni, U. Nanni, and F. Pugliese. A uniform approach to semi-dynamic problems on digraphs. Theoretical Computer Science, 203: 69-90, 1998.
3. E. Cohen. Size-estimation framework with applications to transitive closure and reachability. J. Comput. Syst. Sci., 55(3): 441-453. 1997.
4. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9:251-280, 1990.
5. T. Cormen, C. Leiserson, R. Rivest, and C. Stein. Introduction to algorithms. The MIT Press, second edition, 2001.
6. 2) barrier. In Proceedings of the 41th Annual IEEE Symposium on Foundations of Computer Science, Redondo Beach, California, pages 381-389, 2000.
7. S. Even and Y. Shiloach. An on-line edge-deletion problem. Journal of the ACM, 28(1): 1-4, 1981.
8. 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.
9. H. Gabow. Path-based depth-first search for strong and biconnected components. Information Processing Letters, 74(3-4): 107-114, 2000.
10. M. Henzinger and V. King. Fully dynamic biconnectivity and transitive closure. In Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, pages 664-672, 1995.
11. M. Henzinger and V. King. Randomized fully dynamic graph algorithms with polylogarithmic time per operation. Journal of the ACM, 46(4): 502-516, 1999.
12. J. Holm, K. de Lichtenberg, and M. Thorup. Polylogarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. Journal of the ACM, 48(4): 723-760, 2001.
13. X. Huang and V. Pan. Fast rectangular matrix multiplications and applications. Journal of Complexity, 14:257-299, 1998.
14. G. Italiano. Finding paths and deleting edges in directed acyclic graphs. Information Processing Letters, 28(1) :5-11, 1988.
15. 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.
16. 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.
17. 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.
18. J. La Poutré and J. van Leewen. 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.
19. M. Sharir. A strong-connectivity algorithm and its application in data flow analysis. Computers and Mathematics with Applications, 7(1): 67-72, 1981.
20. R. Tarjan. Depth first search and linear graph algorithms. SIAM Journal on Computing, 11:146-159, 1982.
21. J. Ullman and M. Yannakakis. High probability parallel transitive closure algorithms. SIAM Journal on Computing, 20, 1991.
22. U. Zwick. All-pairs shortest paths using bridging sets and rectangular matrix multiplication. Journal of the ACM, 49:289-317, 2002.