An O(n log n + m log log n) maximum weight clique algorithm for circular-arc graphs
- 1 May 1989
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 31 (3) , 129-134
- https://doi.org/10.1016/0020-0190(89)90220-2
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Stability in circular arc graphsJournal of Algorithms, 1988
- An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc GraphSIAM Journal on Computing, 1988
- Finding maximum cliques on circular-arc graphsInformation Processing Letters, 1987
- Interval graphs and related topicsDiscrete Mathematics, 1985
- Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle GraphsSIAM Journal on Computing, 1985
- Efficient algorithms for interval graphs and circular‐arc graphsNetworks, 1982
- Characterization problems for graphs, partially ordered sets, lattices, and families of setsDiscrete Mathematics, 1976
- Algorithms on circular‐arc graphsNetworks, 1974
- What Are the Intersection Graphs of Arcs in a Circle?The American Mathematical Monthly, 1969
- Scheduling of traffic lights—A new approachTransportation Research, 1968