Analysis of a greedy heuristic for finding small dominating sets in graphs (Q1183397): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximation Algorithms for the Set Covering and Vertex Cover Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximation algorithms for combinatorial problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5509541 / rank | |||
Normal rank | |||
Latest revision as of 15:47, 15 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Analysis of a greedy heuristic for finding small dominating sets in graphs |
scientific article |
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
