An optimal greedy heuristic to color interval graphs (Q922724)
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: An optimal greedy heuristic to color interval graphs |
scientific article; zbMATH DE number 4170126
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal greedy heuristic to color interval graphs |
scientific article; zbMATH DE number 4170126 |
Statements
An optimal greedy heuristic to color interval graphs (English)
0 references
1991
0 references
linear-time algorithms
0 references
interval graphs
0 references
greedy heuristic
0 references
coloring algorithm
0 references
0 references
0.9178425
0 references
0.91191375
0 references
0.90906096
0 references
0.90850693
0 references
0.90325314
0 references
