Improved dynamic reachability algorithms for directed graphs

SIAM Journal on Computing

Volumn 37, Issue 5, 2007, Pages 1455-1471

  Roditty, Liam ^a   Zwick, Uri ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Dynamic algorithms; Strongly connected components; Transitive closure

Indexed keywords

COMPUTATIONAL GEOMETRY; COMPUTER SCIENCE; GRAPH THEORY; MANGANESE COMPOUNDS;

ACYCLIC GRAPHS; ALGORITHMICS; DECREMENTAL ALGORITHMS; DIRECTED GRAPHS; DYNAMIC ALGORITHMS; EDGE DELETIONS; INITIAL GRAPHS; NEW IDEAS; OTHER ALGORITHMS; QUERY TIMES; REACHABILITY ALGORITHMS; REACHABILITY QUERIES; STRONGLY CONNECTED COMPONENTS; TRANSITIVE CLOSURE; TRANSITIVE CLOSURES;

ALGORITHMS;

EID: 43249088871     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/060650271     Document Type: Article

References (28)

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 Symposium on Theory of Computing, Montréal, QC, Canada, 2002, pp, 117-123.
2. E. COHEN, Size-estimation framework with applications to transitive closure and reachability, J. Comput. System Sci., 55 (1997), pp. 441-453.
3. D. COPPERSMITH AND S. WINOGRAD, Matrix multiplication via arithmetic progressions, J. Symbolic Comput., 9 (1990), pp. 251-280.
4. T. H. CORMEN, C. E. LEISERSON, R. L. RIVEST, AND C. STEIN, Introduction to Algorithms, 2nd ed., MIT Press, Cambridge, MA, 2001.
5. 2) barrier, in Proceedings of the 41st Annual Symposium on Foundations of Computer Science, Redondo Beach, CA, 2000, pp. 381-389.
6. 2) barrier, J. ACM, 52 (2005), pp. 147-156.
7. S. EVEN AND Y. SHILOACH, An on-line edge-deletion problem, J. ACM, 28 (1981), pp. 1-4.
8. D. FRIGIONI, T. MILLER, U. NANNI, AND C. ZAROLIAGIS, An experimental study of dynamic algorithms for transitive closure, ACM J. Exp. Algorithmics, 6 (2001), (electronic).
9. H. N. GABOW, Path-based depth-first search for strong and biconnected components, Inform. Process. Lett., 74 (2000), pp. 107-114.
10. M. HENZINGER AND V. KING, Fully dynamic biconnectivity and transitive closure, in Proceedings of the 36th Annual Symposium on Foundations of Computer Science, Milwaukee, WI, 1995, pp. 664-672.
11. M. HENZINGER AND V. KING, Randomized fully dynamic graph algorithms with poly logarithmic time per operation, J. ACM, 46 (1999), pp. 502-516.
12. J. HOLM, K. DE LICHTENBERG, AND M. THORUP, Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity, J. ACM, 48 (2001), pp. 723-760.
13. X. HUANG AND V. Y. PAN, Fast rectangular matrix multiplications and applications, J. Complexity, 14 (1998), pp. 257-299.
14. G. F. ITALIANO, Finding paths and deleting edges in directed acyclic graphs. Inform. Process. Lett., 28 (1988), pp. 5-11.
15. V. KING, Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs, in Proceedings of the 40th Annual Symposium on Foundations of Computer Science, New York, 1999, pp. 81-91.
16. V. KING AND G. SAGERT, A fully dynamic algorithm for maintaining the transitive closure, J. Comput. System Sci., 65 (2002), pp. 150-167.
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 Conference, COCOON, Guilin, China, 2001, pp. 269-277.
18. I. KROMMIDAS AND C. D. ZAROLIAGIS, An experimental study of algorithms for fully dynamic transitive closure, in Lecture Notes in Comput. Sci. 3669, Springer, Berlin, 2005, pp. 544-555.
19. J. A. LA POUTRÉ AND J. VAN LEEUWEN, Maintenance of transitive closure and transitive reduction of graphs, in Proc. of the 13th WG, 1987.
20. L. RODITTY, A faster and simpler fully dynamic transitive closure, in Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, 2003, pp. 404-412.
21. L. RODITTY AND U. ZWICK, Improved dynamic reachability algorithms for directed graphs, in Proceedings of the 43rd Annual Symposium on Foundations of Computer Science, Vancouver, BC, Canada, 2002, pp. 679-688.
22. L. RODITTY AND U. ZWICK, A fully dynamic reachability algorithm for directed graphs with an almost linear update time, in Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, 2004, pp. 184-191.
23. L. RODITTY AND U. ZWICK, On dynamic shortest paths problems, in Proceedings of the 12th Annual European Symposium on Algorithms, Bergen, Norway, 2004, pp. 580-591.
24. P. SANKOWSKI, Dynamic transitive closure via dynamic matrix inverse (extended abstract), in Proceedings of the 45th Annual Symposium on Foundations of Computer Science, Rome, Italy, 2004, pp. 509-517.
25. M. SHARIR, A strong-connectivity algorithm and its application in dataflow analysis, Comput. Math. Appl., 7 (1981), pp. 67-72.
26. R. E. TARJAN, Depth-first search and linear graph algorithms, SIAM J. Comput., 1 (1972), pp. 146-160.
27. J. D. ULLMAN AND M. YANNAKAKIS, High-probability parallel transitive-closure algorithms, SIAM J. Comput., 20 (1991), pp. 100-125.
28. U. ZWICK, All pairs shortest paths using bridging sets and rectangular matrix multiplication, J. ACM, 49 (2002), pp. 289-317.