Algorithms for a maximum clique and a maximum independent set of a circle graph

Abstract

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

DOI: 10.1002/net.3230030305

4 Figures and Tables

Statistics

0510'74'78'83'88'93'98'03'08'13
Citations per Year

115 Citations

Semantic Scholar estimates that this publication has 115 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@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} }