Finding maximum cliques on circular-arc graphs
- 4 December 1987
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 26 (4) , 209-215
- https://doi.org/10.1016/0020-0190(87)90007-x
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- The NP-completeness column: an ongoing guideJournal of Algorithms, 1985
- Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle GraphsSIAM Journal on Computing, 1985
- Preserving order in a forest in less than logarithmic time and linear spaceInformation Processing Letters, 1977