A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs (Q987802): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:21, 30 January 2024
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
