A graph coloring algorithm for large scheduling problems (Q3878752)
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: A graph coloring algorithm for large scheduling problems |
scientific article; zbMATH DE number 3683048
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A graph coloring algorithm for large scheduling problems |
scientific article; zbMATH DE number 3683048 |
Statements
A graph coloring algorithm for large scheduling problems (English)
0 references
1979
0 references
time complexity
0 references
graph coloring algorithm
0 references
sparse graphs
0 references
large-scale scheduling
0 references
large random test graphs
0 references
