Finding a maximum independent set in a permutation graph
- 1 October 1990
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 36 (1), 19-23
- https://doi.org/10.1016/0020-0190(90)90180-6
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Bipartite permutation graphsDiscrete Applied Mathematics, 1987
- Domination in permutation graphsJournal of Algorithms, 1985
- On Comparability and Permutation GraphsSIAM Journal on Computing, 1985
- Finding minimum dominating cycles in permutation graphsOperations Research Letters, 1985
- On testing isomorphism of permutation graphsNetworks, 1981
- A characterization of perfect graphsJournal of Combinatorial Theory, Series B, 1972
- Permutation Graphs and Transitive GraphsJournal of the ACM, 1972
- Transitive Orientation of Graphs and Identification of Permutation GraphsCanadian Journal of Mathematics, 1971