Random procedures for dominating sets in graphs (Q986706)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5769517
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Random procedures for dominating sets in graphs |
scientific article; zbMATH DE number 5769517 |
Statements
Random procedures for dominating sets in graphs (English)
0 references
12 August 2010
0 references
Summary: 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.
0 references
domination
0 references
independence
0 references
probabilistic method
0 references
0.8528816103935242
0 references
0.8027222752571106
0 references
0.7949035167694092
0 references
0.7942216396331787
0 references
