On the feedback vertex set problem in permutation graphs
- 1 November 1994
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 52 (3), 123-129
- https://doi.org/10.1016/0020-0190(94)00133-2
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Connected domination and Steiner set on weighted permutation graphsInformation Processing Letters, 1992
- A new approach for the domination problem on permutation graphsInformation Processing Letters, 1991
- Permutation graphs: Connected domination and Steiner treesDiscrete Mathematics, 1990
- Dominating sets in perfect graphsDiscrete Mathematics, 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
- Transitive Orientation of Graphs and Identification of Permutation GraphsCanadian Journal of Mathematics, 1971