A connected dominating set D is a set of vertices of a graph G=(V,E) such that every vertex in V-D is adjacent to at least one vertex in D and the subgraph induced by the set D is connected. The connected domination number is the minimum of the cardinalities of the connected dominating sets of G. The problem of finding a minimum connected dominating set D is known to be NP-hard. Many polynomial time algorithms that achieve some approximation factors have been provided earlier in finding a minimum connected dominating set. In this work, we present a survey on known properties of graph domination as well as some approximation algorithms. We implemented some of these algorithms and tested them with random graphs and compared their performance in finding a minimum connected dominating set D.
Identifer | oai:union.ndltd.org:USF/oai:scholarcommons.usf.edu:etd-3973 |
Date | 01 January 2005 |
Creators | Mahalingam, Gayathri |
Publisher | Scholar Commons |
Source Sets | University of South Flordia |
Detected Language | English |
Type | text |
Format | application/pdf |
Source | Graduate Theses and Dissertations |
Rights | default |
Page generated in 0.0084 seconds