Undergraduate Research and Innovation Scholar
Fixed-Length Cycle Detection in Directed Graph
- Theory of Computer Science
*Fixed-length cycle detection is an interesting problem in algorithmic graph theory. This research aims to improve upon known algorithms to detect fixed-length cycles. At this stage the student researcher is trying to prove a conjecture on the runtime of an algorithm to detect fixed-length cycles using matrix multiplication. This conjecture was made by R. Yustre and U. Zwick in 2004.