Abstract
AbstractConsider 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 n3 steps, where n is the number of vertices in the graph.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have