Expected polynomial-time randomized algorithm for graph coloring problem (Q6558677)
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: Expected polynomial-time randomized algorithm for graph coloring problem |
scientific article; zbMATH DE number 7868441
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Expected polynomial-time randomized algorithm for graph coloring problem |
scientific article; zbMATH DE number 7868441 |
Statements
Expected polynomial-time randomized algorithm for graph coloring problem (English)
0 references
20 June 2024
0 references
graph coloring
0 references
greedy coloring
0 references
pseudo-vertex
0 references
equivalent order
0 references
heuristic
0 references
expected polynomial time
0 references
0 references
0 references
