A randomized algorithm for determining dominating sets in graphs of maximum degree five

Khamis, Soheir ; Daoud S. ; Essa H. 


Abstract


The paper is devoted to demonstrating a randomized algorithm for determining a dominating set in a given graph having a maximum degree of five. The algorithm follows the Las Vegas technique. Furthermore, the concept of a 2-separated collection of subsets of vertices in graphs is used. The suggested algorithm is based on a condition of the upper bound of the cardinality of a local dominating set. If the condition is not satisfied, then the algorithm halts with an appropriate message. Otherwise, the algorithm determines the dominating set. The given algorithm is considered a polynomial-time approximation one. © 2009 Elsevier B.V. All rights reserved.


Other data

Keywords Minimum dominating set-Las Vegas technique-Randomized algorithm-Polynomial-time approximation algorithm
Issue Date 6-Nov-2009
Journal Theoretical Computer Science 
URI http://research.asu.edu.eg/123456789/1122
DOI 47-49
5122
https://api.elsevier.com/content/abstract/scopus_id/84858709499
410
10.1016/j.tcs.2009.08.011


Recommend this item

CORE Recommender
1
Citations

6
Views


Items in Ain Shams Scholar are protected by copyright, with all rights reserved, unless otherwise indicated.