Highly Influenced

4 Excerpts

- Published 1973 in Networks

Consider a family of chords i n a c ircle . is obtained by representing each chord by a vertex, two vertices being connected by an edge when the corresponding chords intersect. I n t h i s paper, we describe e f f i c i en t algorithms for finding a ma3cimwn clique and a maximum independent s e t of circle graphs. the number of vertices i n the graph. Key WO&: Circle graph, transi t ive graph, interval graph, permutation graph, overlap graph, maximum clique, maximum independent se t . A c irc le graph 3 These algorithms require a t most n steps, where n is

@article{Gavril1973AlgorithmsFA,
title={Algorithms for a maximum clique and a maximum independent set of a circle graph},
author={F. Gavril},
journal={Networks},
year={1973},
volume={3},
pages={261-273}
}