Coloring k-colorable graphs in constant expected parallel time (Q6143974)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7784159
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Coloring k-colorable graphs in constant expected parallel time |
scientific article; zbMATH DE number 7784159 |
Statements
Coloring k-colorable graphs in constant expected parallel time (English)
0 references
5 January 2024
0 references
random graph
0 references
chromatic number
0 references
input graph
0 references
average running time
0 references
0 references
0.845521867275238
0 references
0.8421871066093445
0 references
0.8330458998680115
0 references
