New clique and independent set algorithms for circle graphs
- 30 March 1992
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 36 (1) , 1-24
- https://doi.org/10.1016/0166-218x(92)90200-t
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two stringsInformation Processing Letters, 1986
- 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
- A priority queue in which initialization and queue operations takeO(loglogD) timeTheory of Computing Systems, 1981
- A fast algorithm for computing longest common subsequencesCommunications of the ACM, 1977
- On computing the length of longest increasing subsequencesDiscrete Mathematics, 1975
- Algorithms on circular‐arc graphsNetworks, 1974
- Algorithms for a maximum clique and a maximum independent set of a circle graphNetworks, 1973
- Permutation Graphs and Transitive GraphsJournal of the ACM, 1972
- A Decomposition Theorem for Partially Ordered SetsAnnals of Mathematics, 1950