Algorithms for a maximum clique and a maximum independent set of a circle graph
- 1 January 1973
- Vol. 3 (3) , 261-273
- https://doi.org/10.1002/net.3230030305
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Permutation Graphs and Transitive GraphsJournal of the ACM, 1972
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal GraphSIAM Journal on Computing, 1972
- QUEUES, STACKS AND GRAPHSPublished by Elsevier ,1971
- Incidence matrices and interval graphsPacific Journal of Mathematics, 1965
- A Characterization of Comparability Graphs and of Interval GraphsCanadian Journal of Mathematics, 1964
- Representation of a finite graph by a set of intervals on the real lineFundamenta Mathematicae, 1962
- On rigid circuit graphsAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1961