On the complexity of distributed graph coloring with local minimality constraints (Q3057099): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 22:45, 3 February 2024

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