Finding maximum cliques in circle graphs
โ
D. Rotem; J. Urrutia
๐
Article
๐
1981
๐
John Wiley and Sons
๐
English
โ 505 KB
## Abstract A circle diagram consists of a circle __C__ and a set of __n__ chords. This diagram defines a graph with __n__ vertices where each vertex corresponds to a chord, and two vertices are adjacent if their corresponding chords intersect in __C__. A graph __G__ is called a circle graph if it