A New Optimality Measure for Distance Dominating Sets

A New Optimality Measure for Distance Dominating Sets

Show other versions (1)

  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...

Full description

Bibliographic Details
Main Author: Simjour, Narges
Format: Others
Language:en
Published: University of Waterloo 2007
Subjects:
Computer Science
distance dominating set
domatic number
approximation algorithm
exact algorithm
spanner
Online Access:http://hdl.handle.net/10012/2941

Internet

http://hdl.handle.net/10012/2941

Similar Items