Back to Search
Start Over
A randomized algorithm for determining dominating sets in graphs of maximum degree five
- Source :
-
Theoretical Computer Science . Nov2009, Vol. 410 Issue 47-49, p5122-5127. 6p. - Publication Year :
- 2009
-
Abstract
- 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. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 03043975
- Volume :
- 410
- Issue :
- 47-49
- Database :
- Academic Search Index
- Journal :
- Theoretical Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 44584573
- Full Text :
- https://doi.org/10.1016/j.tcs.2009.08.011