Key points are not available for this paper at this time.
Abstract Consider a family of chords in a circle. A circle graph is obtained by representing each chord by a vertex, two vertices being connected by an edge when the corresponding chords intersect. In this paper, we describe efficient algorithms for finding a maximum clique and a maximum independent set of circle graphs. These algorithms require at most n 3 steps, where n is the number of vertices in the graph.
Fǎnicǎ Gavril (Mon,) studied this question.