(2Δ — l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting (Q5363083): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 19:59, 5 March 2024
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
