(2Δ — l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting (Q5363083): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 01:27, 9 February 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