\((2\Delta-1)\)-edge-coloring is much easier than maximal matching in the distributed setting (Q5363083)
From MaRDI portal
!
WARNING
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 6786398
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \((2\Delta-1)\)-edge-coloring is much easier than maximal matching in the distributed setting |
scientific article; zbMATH DE number 6786398 |
Statements
(2Δ — l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting (English)
0 references
5 October 2017
0 references
0.8922946453094482
0 references
0.8905649185180664
0 references
0.8807755708694458
0 references
0.8755648136138916
0 references
0.8745631575584412
0 references
