A New Optimality Measure for Distance Dominating Sets
We study the problem of finding the smallest power of an input graph that has <em>k</em> disjoint dominating sets, where the <em>i</em>th power of an input graph <em>G</em> is constructed by adding edges between pairs of vertices in <em>G</em> at dis...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | en |
| Published: |
University of Waterloo
2007
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10012/2941 |