Fast sparse matrix multiplication

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3221, Issue , 2004, Pages 604-615

  Yuster, Raphael ^a   Zwick, Uri ^b  

^a UNIVERSITY OF HAIFA   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; ALGORITHMS;

A-RINGS; ALGEBRAIC OPERATIONS; DENSE MATRICES; FAST RECTANGULAR MATRIX MULTIPLICATIONS; MATRIX MULTIPLICATION ALGORITHM; OPTIMAL NUMBER; SPARSE MATRICES; THEORETICAL VALUES;

MATRIX ALGEBRA;

EID: 35048828796     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30140-0_54     Document Type: Article

References (25)

1. N. Alon, R. Yuster, and U. Zwick. Color-coding. Journal of the ACM, 42:844-856, 1995.
2. N. Alon, R. Yuster, and U. Zwick. Finding and counting given length cycles. Algorithmica, 17:209-223, 1997.
3. P. Bürgisser, M. Clausen, and M.A. Shokrollahi. Algebraic complexity theory. Springer-Verlag, 1997.
4. T. Chan. Dynamic subgraph connectivity with geometric applications. In Proc. of 34th STOC, pages 7-13, 2002.
5. J. Cheriyan. Randomized Õ(M(|V|)) algorithms for problems in matching theory. SIAM Journal on Computing, 26:1635-1655, 1997.
6. H. Cohn and C. Umans. A group-theoretic approach to fast matrix multiplication. In Proc. of 44th FOGS, pages 438-449, 2003.
7. D. Coppersmith. Rectangular matrix multiplication revisited. Journal of Complexity, 13:42-49, 1997.
8. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9:251-280, 1990.
9. 2) barrier. In Proceedings of FOCS'00, pages 381-389, 2000.
10. F. Eisenbrand and F. Grandoni. Detecting directed 4-cycles still faster. Information Processing Letters, 87(1):13-15, 2003.
11. F.G. Gustavson. Two fast algorithms for sparse matrices: Multiplication and permuted transposition. ACM Transactions on Mathematical Software, 4(3):250-269, 1978.
12. X. Huang and V.Y. Pan. Fast rectangular matrix multiplications and applications. Journal of Complexity, 14:257-299, 1998.
13. α). In Proc. of 14th SODA, pages 709-716, 2003.
14. K. Mulmuley, U. V. Vazirani, and V. V. Vazirani. Matching is as easy as matrix inversion. Combinatorica, 7:105-113, 1987.
15. J. Nešetřil and S. Poljak. On the complexity of the subgraph problem. Commentationes Mathematicae Universitatis Carolinae, 26(2):415-419, 1985.
16. V. Pan. How to multiply matrices faster. Lecture notes in computer science, volume 179. Springer-Verlag, 1985.
17. M.O. Rabin and V.V. Vazirani. Maximum matchings in general graphs through randomization. Journal of Algorithms, 10:557-567, 1989.
18. R. Raz. On the complexity of matrix product. SIAM Journal on Computing, 32:1356-1369, 2003.
19. L. Roditty and U. Zwick. Improved dynamic reachability algorithms for directed graphs. In Proceedings of FOCS'02, pages 679-689, 2002.
20. R. Seidel. On the all-pairs-shortest-path problem in unweighted undirected graphs. Journal of Computer and System Sciences, 51:400-403, 1995.
21. A. Shoshan and U. Zwick. All pairs shortest paths in undirected graphs with integer weights. In Proc. of 40th FOCS, pages 605-614, 1999.
22. A. Shpilka. Lower bounds for matrix product. SIAM Journal on Computing, 32:1185-1200, 2003.
23. V. Strossen. Gaussian elimination is not optimal. Numerische Mathematik, 13:354-356, 1969.
24. R. Yuster and U. Zwick. Detecting short directed cycles using rectangular matrix multiplication and dynamic programming. In Proc. of 15th SODA, pages 247-253, 2004.
25. U. Zwick. All-pairs shortest paths using bridging sets and rectangular matrix multiplication. Journal of the ACM, 49:289-317, 2002.