Detecting short directed cycles using rectangular matrix multiplication and dynamic programming

@inproceedings{Yuster2004DetectingSD,
title={Detecting short directed cycles using rectangular matrix multiplication and dynamic programming},
author={Raphael Yuster and Uri Zwick},
booktitle={SODA},
year={2004}
}

We present several new algorithms for detecting short fixed length cycles in digraphs. The new algorithms utilize fast rectangular matrix multiplication algorithms together with a dynamic programming approach similar to the one used in the solution of the classical chain matrix product problem. The new algorithms are instantiations of a generic algorithm that we present for finding a directed <i>C</i><inf><i>k</i></inf>, i.e., a directed cycle of length <i>k</i>, in a digraph, for any fixed <i… CONTINUE READING