An efficient self-stabilizing distance-2 coloring algorithm (Q442253): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Models and solution techniques for frequency assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5442385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A self-stabilizing algorithm for coloring planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4791937 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time self-stabilizing colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-stabilizing coloration in anonymous planar networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A self-stabilizing algorithm for coloring bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems / rank
 
Normal rank

Latest revision as of 12:44, 5 July 2024

scientific article
Language Label Description Also known as
English
An efficient self-stabilizing distance-2 coloring algorithm
scientific article

    Statements

    Identifiers

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