Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs
- 1 February 1985
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 14 (1) , 224-231
- https://doi.org/10.1137/0214018
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Efficient algorithms for interval graphs and circular‐arc graphsNetworks, 1982
- Finding maximum cliques in circle graphsNetworks, 1981
- The Complexity of Coloring Circular Arcs and ChordsSIAM Journal on Algebraic Discrete Methods, 1980
- Preserving order in a forest in less than logarithmic time and linear spaceInformation Processing Letters, 1977
- Design and implementation of an efficient priority queueTheory of Computing Systems, 1976
- Algorithms on circular‐arc graphsNetworks, 1974
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- Algorithms for a maximum clique and a maximum independent set of a circle graphNetworks, 1973
- Scheduling of traffic lights—A new approachTransportation Research, 1968
- Circular genetic mapsJournal of Cellular Physiology, 1967