A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs (Q987802): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2009.01.009 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2075907664 / rank | |||
Normal rank | |||
Revision as of 20:59, 19 March 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
