P271: Enumeration of all cliques in a chordal graph

P271: Enumeration of all cliques in a chordal graph

Input:

A chordal graph $G$.

Output:

All cliques in $G$.

Complexity:

$O(1)$ time per solution on average.

Comment:

Reference:

[Kiyomi2006] (Bibtex)