On improved time bounds for permutation graph problems
- 1 January 1993
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Efficient algorithms for the minimum weighted dominating clique problem on permutation graphsTheoretical Computer Science, 1991
- A new approach for the domination problem on permutation graphsInformation Processing Letters, 1991
- Finding a maximum independent set in a permutation graphInformation Processing Letters, 1990
- An efficient algorithm for maxdominance, with applicationsAlgorithmica, 1989
- Finding a minimum independent dominating set in a permutation graphDiscrete Applied Mathematics, 1988
- On domination problems for permutation and other graphsTheoretical Computer Science, 1987
- Domination in permutation graphsJournal of Algorithms, 1985
- On Comparability and Permutation GraphsSIAM Journal on Computing, 1985
- Permutation Graphs and Transitive GraphsJournal of the ACM, 1972
- Transitive Orientation of Graphs and Identification of Permutation GraphsCanadian Journal of Mathematics, 1971