P107: Enumeration of all maximum cliques in a circle graph
P107: Enumeration of all maximum cliques in a circle graph
Input:
A circle graph $G = (V, E)$.
Output:
All maximum cliques in $G$.
Complexity:
$O(1)$ time per maximum clique.
Comment:
A graph is a circle graph if it is the intersection graph of chords in a circle. The definition of a circle graph can be found in Information System on Graph Classes and their Inclusions\footnote{\url{http://www.graphclasses.org/classes/gc\_132.html}}.