A better than “best possible” algorithm to edge color multigraphs (Q3725544)
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 better than “best possible” algorithm to edge color multigraphs |
scientific article; zbMATH DE number 3956439
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A better than “best possible” algorithm to edge color multigraphs |
scientific article; zbMATH DE number 3956439 |
Statements
A better than “best possible” algorithm to edge color multigraphs (English)
0 references
1986
0 references
graph algorithm
0 references
edge coloring
0 references
0.8962132930755615
0 references
0.8816031813621521
0 references
0.8763608932495117
0 references
0.8757413029670715
0 references
