Dynamic transitive closure via dynamic matrix inverse

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2004, Pages 509-517

  Sankowski, Piotr ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC MATRIX PROBLEMS; MATRIX INVERSE; PERFECT MATCHING; QUERY TIMES;

ALGORITHMS; ERRORS; GRAPH THEORY; LINEAR SYSTEMS; MATRIX ALGEBRA; PROBLEM SOLVING; QUERY LANGUAGES;

INVERSE PROBLEMS;

EID: 17744382631     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2004.25     Document Type: Conference Paper

References (24)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley Longman Publishing Co., Inc., 1974.
2. J. Bunch and J. Hopcroft. Triangular factorization and inversion by fast matrix multiplication. Math. Comp., 28:231-236, 1974.
3. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. In Proceedings of the nineteenth annual ACM conference on Theory of computing, pages 1-6. ACM Press, 1987.
4. Don Coppersmith. Rectangular matrix multiplication revisited. J. Complex., 13(1):42-49, 1997.
5. 2) barrier. In IEEE Symposium on Foundations of Computer Science, pages 381-389, 2000.
6. Gudmund Skovbjerg Frandsen, Johan P. Hansen, and Peter Bro Miltersen. Lower bounds for dynamic algebraic problems. Lecture Notes in Computer Science, 1563:362-372, 1999.
7. M. R. Henzinger and V. King. Fully dynamic biconnectivity and transitive closure. In Proc. 36th IEEE Symp. Foundations of Computer Science, pages 664-672, 1995.
8. X. Huang and V.Y. Pan. Fast rectangular matrix multiplication and applications. Journal of complexity, 14(2):257-299, 1998.
9. T. Ibaraki and N. Katoh. On-line computation of transitive closure for graphs. Inform. Proc. Lett., 16:95-97, 1983.
10. G. F. Italiano. Amortized efficiency of a path retrieval data structure. Theor. Comput. Sci., 48(2-3):273-281, 1986.
11. S. Khanna, R. Motwani, and R. H. Wilson. On certificates and lookahead on dynamic graph problems. In Proc. 7th ACM-SIAM Symp. Discrete Algorithms, pages 222-231, 1996.
12. Valerie King. Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs. In IEEE Symposium on Foundations of Computer Science, pages 81-91, 1999.
13. Valerie King and Garry Sagert. A fully dynamic algorithm for maintaining the transitive closure. In Proceedings of the thirty-first annual ACM symposium on Theory of computing, pages 492-498. ACM Press, 1999.
14. J. A. La Poutré and J. van Leeuwen. Maintenance of transitive closure and transitive reduction of graphs. In Proc. Workshop on Graph-Theoretic Concepts in Computer Science, pages 106-120. Lecture Notes in Computer Science 314, Springer-Verlag, Berlin, 1988.
15. L. Lovász. On determinants, matching and random algorithms. Fundamentals odf Computation Theory, 1979.
16. M. Mucha and P. Sankowski. Maximum matchings via gaussian elimination. 45th Annual IEEE Symposium on Fundations of Computer Science, accepted, 2004.
17. M. O. Rabin and V. V. Vazirani. Maximum matchings in general graphs through randomization. Journal of Algorithms, 10:557-567, 1989.
18. John H. Reif and Stephen R. Tate. On dynamic algorithms for algebraic problems. J. Algorithms, 22(2):347-371, 1997.
19. Liam Roditty. A faster and simpler fully dynamic transitive closure. In Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, pages 404-412. Society for Industrial and Applied Mathematics, 2003.
20. Liam Roditty and Uri Zwick. Improved dynamic reachability algorithms for directed graphs. In Proceedings of the 43rd Symposium on Foundations of Computer Science, page 679. IEEE Computer Society, 2002.
21. Liam Roditty and Uri Zwick. A fully dynamic reachability algorithm for directed graphs with an almost linear update time. In Proceeding of the 36th annual ACM symposium on Theory of computing, To appear. ACM Press, 2004.
22. J. T. Schwartz. Fast probabilistic algorithms for verification of polynomial identities. J. Algorithms, 10:701-717, 1980.
23. D. M. Yellin. Speeding up dynamic transitive closure for bounded degree graphs. Acta Informatica, 30:369-384, 1993.
24. R. E. Zippel. Probabilistic algorithms for sparse polynomials. Proc. EUROSAM 79, Lecture Notes in Computer Science 72, pages 216-226, 1979.