(2Δ — l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting (Q5363083)
From MaRDI portal
scientific article; zbMATH DE number 6786398
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | (2Δ — l)-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
