Detecting short directed cycles using rectangular matrix multiplication and dynamic programming

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 247-253

  Yuster, Raphael ^a   Zwick, Uri ^b  

^a UNIVERSITY OF HAIFA   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; LINEAR PROGRAMMING; MATRIX ALGEBRA; PROBLEM SOLVING; THEOREM PROVING;

MATRIX MULTIPLICATION ALGORITHMS; POLYALGORITHMIC FACTORS;

GRAPH THEORY;

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

References (10)

1. [AYZ95] N. Alon, R. Yuster, and U. Zwick. Color-coding. Journal of the ACM, 42:844-856, 1995.
2. [AYZ97] N. Alon, R. Yuster, and U. Zwick. Finding and counting given length cycles. Algorithmica, 17:209-223, 1997.
3. [CLRS01] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein. Introduction to algorithms. The MIT Press, second edition, 2001.
4. [Cop97] D. Coppersmith. Rectangular matrix multiplication revisited. Journal of Complexity, 13:42-49, 1997.
5. [CW90] D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9:251-280, 1990.
6. 2) barrier. In Proc. of 41st FOCS, pages 381-389, 2000.
7. [EG03] F. Eisenbrand and F. Grandoni. Detecting directed 4-cycles still faster. Information Processing Letters, 87(1):13-15, 2003.
8. [HP98] X. Huang and V.Y. Pan. Fast rectangular matrix multiplications and applications. Journal of Complexity, 14:257-299, 1998.
9. α). In Proc. of 14th SODA, pages 709-716, 2003.
10. [Zwi02] U. Zwick. All-pairs shortest paths using bridging sets and rectangular matrix multiplication. Journal of the ACM, 49:289-317, 2002.