Random procedures for dominating sets in graphs

Artmann, Sarah GND; Göring, Frank; Harant, Jochen GND; Rautenbach, Dieter; Schiermeyer, Ingo

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.


Citation style:
Could not load citation form.


Use and reproduction:
All rights reserved