P194: Enumeration of all $C_k$'s in a graph

P194: Enumeration of all $C_k$'s in a graph

Input:

A graph $G$ and an integer $k \ge 4$.

Output:

All of all $C_k$'s in $G$.

Complexity:

$O(|V|^{k-1} + p_k(G) + c_k(G))$ total time.

Comment:

$P_k$ and $C_k$ are a induced path and cycle of $G$ with $k$ vertices, respectively. $p_k(G)$ and $c_k(G)$ are the number of $P_k$ and $C_k$ in $G$, respectively.

Reference:

[Hoang2013] (Bibtex)