Detecting directed 4-cycles still faster

Information Processing Letters

Volumn 87, Issue 1, 2003, Pages 13-15

  Eisenbrand, Friedrich ^a   Grandoni, Fabrizio ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF ROME TOR VERGATA   (Italy)

Author keywords

Algorithms; Computational complexity; Directed 4 cycle

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATRIX ALGEBRA; PROBLEM SOLVING;

DIRECTED CYCLES;

GRAPH THEORY;

EID: 0037910462     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(03)00252-7     Document Type: Article

References (7)

1. Alon N., Yuster R., Zwick U. Color-coding. J. ACM. 42:(4):1995;844-856.
2. Alon N., Yuster R., Zwick U. Finding and counting given length cycles. Algorithmica. 17:(3):1997;209-223.
3. Coppersmith D., Winograd S. Matrix multiplication via arithmetic progressions. J. Symbolic Comput. 9:(3):1990;251-280.
4. Huang X., Pan V.Y. Fast rectangular matrix multiplication and applications. J. Complexity. 14:(2):1998;257-299.
5. Itai A., Rodeh M. Finding a minimum circuit in a graph. SIAM J. Comput. 7:(4):1978;413-423.
6. Kloks T., Kratsch D., Müller H. Finding and counting small induced subgraphs efficiently. Inform. Process. Lett. 74:(3-4):2000;115-121.
7. Yuster R., Zwick U. Finding even cycles even faster. SIAM J. Discrete Math. 10:(2):1997;209-222.