Approximation ratio of the min-degree greedy algorithm for maximum independent set on interval and chordal graphs (Q6648269)
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: Approximation ratio of the min-degree greedy algorithm for maximum independent set on interval and chordal graphs |
scientific article; zbMATH DE number 7953881
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation ratio of the min-degree greedy algorithm for maximum independent set on interval and chordal graphs |
scientific article; zbMATH DE number 7953881 |
Statements
Approximation ratio of the min-degree greedy algorithm for maximum independent set on interval and chordal graphs (English)
0 references
4 December 2024
0 references
greedy algorithms
0 references
maximum independent set
0 references
chordal graphs
0 references
interval graphs
0 references
approximation algorithms
0 references
