Greed is good: Approximating independent sets in sparse and bounded-degree graphs (Q679458): Difference between revisions
From MaRDI portal
Revision as of 11:17, 27 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Greed is good: Approximating independent sets in sparse and bounded-degree graphs |
scientific article |
Statements
Greed is good: Approximating independent sets in sparse and bounded-degree graphs (English)
0 references
20 July 1997
0 references
minimum-degree greedy algorithm
0 references