Domination in permutation graphs |
| |
| Authors: | Martin Farber J Mark Keil |
| |
| Institution: | Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1;Department of Computational Science, University of Saskatchewan, Saskatoon, Saskatchewan, Canada S7N OWO |
| |
| Abstract: | O(n3) algorithms to solve the weighted domination and weighted independent domination problems in permutation graphs, and an O(n2) algorithm to solve the cardinality domination problem in permutation graphs are presented. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
