A randomized algorithm for determining dominating sets in graphs of maximum degree five (Q1034633)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A randomized algorithm for determining dominating sets in graphs of maximum degree five |
scientific article; zbMATH DE number 5626978
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A randomized algorithm for determining dominating sets in graphs of maximum degree five |
scientific article; zbMATH DE number 5626978 |
Statements
A randomized algorithm for determining dominating sets in graphs of maximum degree five (English)
0 references
6 November 2009
0 references
minimum dominating set
0 references
Las Vegas technique
0 references
randomized algorithm
0 references
polynomial-time approximation algorithm
0 references
0.9082415
0 references
0.9082415
0 references
0.8839301
0 references
0.8797777
0 references
0.87680876
0 references
0.8735472
0 references
0.8687929
0 references
