Heuristic algorithms for the min-max edge 2-coloring problem (Q1791033)
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: Heuristic algorithms for the min-max edge 2-coloring problem |
scientific article; zbMATH DE number 6946825
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Heuristic algorithms for the min-max edge 2-coloring problem |
scientific article; zbMATH DE number 6946825 |
Statements
Heuristic algorithms for the min-max edge 2-coloring problem (English)
0 references
4 October 2018
0 references
0.8580974340438843
0 references
0.8515352606773376
0 references
0.8498780727386475
0 references
0.8480662703514099
0 references
0.7880832552909851
0 references
