A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph (Q5445753): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A self-stabilizing distributed algorithm for minimal spanning tree problem in a symmetric graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chromatic sums and distributed resource allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Color Sum of Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-stabilizing systems in spite of distributed control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sum coloring of distance and circulant graphs / 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: Minimal coloring and strength of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time self-stabilizing colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A self-stabilizing algorithm for maximal matching / 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: Coloring of trees with minimum sum of colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic sum of a graph: history and recent developments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sum coloring and interval graphs: A tight upper bound for the minimum number of colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sum coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An anonymous self-stabilizing algorithm for 1-maximal independent set in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A self-stabilizing algorithm for coloring bipartite graphs / rank
 
Normal rank

Latest revision as of 17:23, 27 June 2024

scientific article; zbMATH DE number 5243319
Language Label Description Also known as
English
A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph
scientific article; zbMATH DE number 5243319

    Statements

    A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph (English)
    0 references
    0 references
    0 references
    0 references
    6 March 2008
    0 references

    Identifiers