A greedy probabilistic heuristic for graph black-and-white anticoloring (Q6616239)
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 greedy probabilistic heuristic for graph black-and-white anticoloring |
scientific article; zbMATH DE number 7923837
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A greedy probabilistic heuristic for graph black-and-white anticoloring |
scientific article; zbMATH DE number 7923837 |
Statements
A greedy probabilistic heuristic for graph black-and-white anticoloring (English)
0 references
8 October 2024
0 references
anticoloring
0 references
random graphs
0 references
denormalization
0 references
0 references
0.8185103535652161
0 references
0.8090571761131287
0 references
0.7912371754646301
0 references
0.7867951393127441
0 references
0.7825120091438293
0 references
