Exact Algorithms for Finding Fixed-Length Cycles in Edge-Weighted Graphs

We describe our recent work on the problem of producing fixed-length cycles in edge-weighted graphs. We give two exact methods for this
$\mathcal{NP}\mathbf{-hard}$
problem and briefly consider their scaling-up characteristics.