A randomized algorithm for determining dominating sets in graphs of maximum degree fiveKhamis, Soheir ; Daoud S. ; Essa H.
AbstractThe 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.
|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
Recommend this item
|A randomized algorithm for determining dominating sets in graphs of.pdf||509.42 kB||Adobe PDF||View/Open|
Items in Ain Shams Scholar are protected by copyright, with all rights reserved, unless otherwise indicated.