Random procedures for dominating sets in graphs
We present and analyze some random procedures for the construction of small dominating sets in graphs. Several upper bounds for the domination number of a graph are derived from these procedures.
Use and reproduction:
All rights reserved