Gavril, F. Algorithms for a maximum clique and a maximum independent set of a circle graph. (English) Zbl 0259.05125 Networks 3, 261-273 (1973). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 2 ReviewsCited in 60 Documents MSC: 05C99 Graph theory 05-04 Software, source code, etc. for problems pertaining to combinatorics PDFBibTeX XMLCite \textit{F. Gavril}, Networks 3, 261--273 (1973; Zbl 0259.05125) Full Text: DOI References: [1] and , ”Queus, Stacks and Graphs,” Theory of Machines and Computations, and , ed., Academic Press, New York, 1971, pp. 71–86. [2] Even, J. ACM 19 pp 400– (1972) [3] Dirac, Abh. Math., University Hamburg 25 pp 71– (1961) · Zbl 0098.14703 [4] Gilmore, Canad. J. Math 16 pp 539– (1964) · Zbl 0121.26003 [5] Fulkerson, Pacific J. Math. 15 pp 835– (1965) · Zbl 0132.21001 [6] Lekkerkerker, Fundamenta Mathematicae 51 pp 45– (1962) [7] Gavril, Siam J. Comput. 1 pp 180– (1972) This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.