A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs (Q987802)
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 note on the greedy algorithm for finding independent sets of C_k-free graphs |
scientific article; zbMATH DE number 5771245
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs |
scientific article; zbMATH DE number 5771245 |
Statements
A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs (English)
0 references
16 August 2010
0 references
approximation algorithms
0 references
analysis of algorithms
0 references
maximum independent set
0 references
0.89767694
0 references
0.8955674
0 references
0 references
0.8932748
0 references
0.8928064
0 references
0.88817406
0 references
0 references
