(2Δ — l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting (Q5363083)

From MaRDI portal
Revision as of 00:27, 9 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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
    0 references
    0 references
    0 references
    5 October 2017
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references