Analysis of a greedy heuristic for finding small dominating sets in graphs (Q1183397)
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: Analysis of a greedy heuristic for finding small dominating sets in graphs |
scientific article; zbMATH DE number 33265
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Analysis of a greedy heuristic for finding small dominating sets in graphs |
scientific article; zbMATH DE number 33265 |
Statements
Analysis of a greedy heuristic for finding small dominating sets in graphs (English)
0 references
28 June 1992
0 references
Consider the problem of finding a minimum dominating set in an undirected graph. The author obtains an upper bound on the size of the dominating set returned by the greedy algorithm.
0 references
dominating sets
0 references
greedy heuristic
0 references
0.9039551
0 references
0.90134484
0 references
0.90023273
0 references
0.8910209
0 references
0.88775563
0 references
0.8864388
0 references
0.8846015
0 references
0.8807785
0 references
0.8805624
0 references
