Listing Even Cycles Faster than the Submodular-Width Barrier

Vasileios Nakos, Hung Q. Ngo, Andreas Panayi

A classic result of Alon, Yuster, and Zwick (AYZ, Algorithmica 1997) shows that all $2k$-cycles in an $m$-edge graph can be listed in $\tilde{O}(m^{2-1/k}+t)$ time, where $t$ is the…