论文信息 - Algorithms for a maximum clique and a maximum independent set of a circle graph

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

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 n3 steps, where n is the number of vertices in the graph.

Fanica Gavril | F. Gavril

[1] P. Gilmore,et al. A Characterization of Comparability Graphs and of Interval Graphs , 1964, Canadian Journal of Mathematics.

[2] G. Dirac. On rigid circuit graphs , 1961 .

[3] A. Itai,et al. QUEUES, STACKS AND GRAPHS , 1971 .

[4] Amir Pnueli,et al. Permutation Graphs and Transitive Graphs , 1972, JACM.

[5] Fanica Gavril,et al. Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph , 1972, SIAM J. Comput..

[6] D. R. Fulkerson,et al. Incidence matrices and interval graphs , 1965 .

[7] C. Lekkeikerker,et al. Representation of a finite graph by a set of intervals on the real line , 1962 .