A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph

DOI10.1007/978-3-540-77444-0_19zbMath1131.68489OpenAlexW1591566824MaRDI QIDQ5445753

Huang Sun, Brice Effantin, Hamamache Kheddouci

Publication date: 6 March 2008

Published in: Distributed Computing and Networking (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77444-0_19

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Distributed systems (68M14)

Related Items (3)

An efficient self-stabilizing distance-2 coloring algorithm ⋮ A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs ⋮ An Efficient Self-stabilizing Distance-2 Coloring Algorithm

Cites Work

• Linear time self-stabilizing colorings
• Self-stabilizing coloration in anonymous planar networks
• A self-stabilizing algorithm for maximal matching
• A self-stabilizing algorithm for coloring planar graphs
• On chromatic sums and distributed resource allocation
• A self-stabilizing distributed algorithm for minimal spanning tree problem in a symmetric graph
• The chromatic sum of a graph: history and recent developments
• A self-stabilizing algorithm for coloring bipartite graphs
• On sum coloring of graphs
• Sum coloring and interval graphs: A tight upper bound for the minimum number of colors
• Minimal coloring and strength of graphs
• An anonymous self-stabilizing algorithm for 1-maximal independent set in trees
• Sum coloring of distance and circulant graphs
• Self-stabilizing systems in spite of distributed control
• Minimum Color Sum of Bipartite Graphs
• Coloring of trees with minimum sum of colors

This page was built for publication: A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph