P317: Enumeration of all cycles of a given length in a graph

P317: Enumeration of all cycles of a given length in a graph

Input:

A graph $G$ and an integer $k$.

Output:

All cycles of length $k$ in $G$.

Complexity:

See paper.

Comment:

Reference:

[Alon1997] (Bibtex)