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

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...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 410; no. 47; pp. 5122 - 5127
Main Authors:	Khamis, Soheir M., Daoud, Sameh S., Essa, Hanaa A.E.
Format:	Journal Article
Language:	English
Published:	Oxford Elsevier B.V 06.11.2009 Elsevier
Subjects:	Algorithmics. Computability. Computer arithmetics Applied sciences Approximations and expansions Computer science; control theory; systems Exact sciences and technology Information retrieval. Graph Las Vegas technique Mathematical analysis Mathematics Minimum dominating set Miscellaneous Polynomial-time approximation algorithm Randomized algorithm Sciences and techniques of general use Theoretical computing Randomized algorithm Minimum dominating set Polynomial-time approximation algorithm Las Vegas technique Concept Polynomial Dominating set Computer theory Polynomial approximation Approximation algorithm Polynomial time Upper bound Maximum Graph degree
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!