Finding a minimum independent dominating set in a permutation graph
- 31 October 1988
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 21 (3), 177-183
- https://doi.org/10.1016/0166-218x(88)90064-9
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Domination in permutation graphsJournal of Algorithms, 1985
- Some modified algorithms for Dijkstra's longest upsequence problemActa Informatica, 1982
- Maintenance of configurations in the planeJournal of Computer and System Sciences, 1981
- Some beautiful arguments using mathematical inductionActa Informatica, 1980