A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs (Q987802)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs |
scientific article |
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
