Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs
- 19 October 1992
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 43 (6), 293-295
- https://doi.org/10.1016/0020-0190(92)90114-b
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Finding a maximum independent set in a permutation graphInformation Processing Letters, 1990
- On Comparability and Permutation GraphsSIAM Journal on Computing, 1985
- Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle GraphsSIAM Journal on Computing, 1985
- 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