(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 OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/1.9781611973730.26 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4229705835 / rank | |||
Normal rank | |||
Latest revision as of 02:06, 20 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
