1. A randomized algorithm for determining dominating sets in graphs of maximum degree five
- Author
-
Khamis, Soheir M., Daoud, Sameh S., and Essa, Hanaa A.E.
- Subjects
- *
ALGORITHMS , *DOMINATING set , *SET theory , *GRAPH theory , *TOPOLOGICAL degree , *POLYNOMIALS , *COMPUTER science , *MATHEMATICAL analysis - 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]
- Published
- 2009
- Full Text
- View/download PDF