On domination problems for permutation and other graphs
- 31 October 1987
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 54 (2-3) , 181-198
- https://doi.org/10.1016/0304-3975(87)90128-9
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Bipartite permutation graphsDiscrete Applied Mathematics, 1987
- Weakly triangulated graphsJournal of Combinatorial Theory, Series B, 1985
- Domination in permutation graphsJournal of Algorithms, 1985
- Finding minimum dominating cycles in permutation graphsOperations Research Letters, 1985
- Clustering and domination in perfect graphsDiscrete Applied Mathematics, 1984
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1984
- Permutation Graphs and Transitive GraphsJournal of the ACM, 1972
- Transitive Orientation of Graphs and Identification of Permutation GraphsCanadian Journal of Mathematics, 1971