Finding maximum cliques in circle graphs
- 1 September 1981
- Vol. 11 (3) , 269-278
- https://doi.org/10.1002/net.3230110305
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- On computing the length of longest increasing subsequencesDiscrete Mathematics, 1975
- Algorithms for a maximum clique and a maximum independent set of a circle graphNetworks, 1973
- Permutation Graphs and Transitive GraphsJournal of the ACM, 1972
- Transitive Orientation of Graphs and Identification of Permutation GraphsCanadian Journal of Mathematics, 1971
- QUEUES, STACKS AND GRAPHSPublished by Elsevier ,1971
- Longest Increasing and Decreasing SubsequencesCanadian Journal of Mathematics, 1961