On the complexity of distributed graph coloring with local minimality constraints (Q3057099)

From MaRDI portal
Revision as of 06:18, 10 May 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q62048702, #quickstatements; #temporary_batch_1715314706700)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the complexity of distributed graph coloring with local minimality constraints
scientific article

    Statements

    On the complexity of distributed graph coloring with local minimality constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    24 November 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    distributed computing
    0 references
    graph coloring
    0 references
    greedy algorithm
    0 references
    randomization
    0 references
    0 references
    0 references