An Efficient Self-stabilizing Distance-2 Coloring Algorithm

DOI10.1007/978-3-642-11476-2_19zbMath1274.05448OpenAlexW2161438373MaRDI QIDQ3408175

Fredrik Manne, Jean R. S. Blair

Publication date: 24 February 2010

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11476-2_19

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Efficient transformation of distance-2 self-stabilizing algorithms

Uses Software

• CALMA

Cites Work

• Unnamed Item
• Unnamed Item
• A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems
• Linear time self-stabilizing colorings
• Self-stabilizing coloration in anonymous planar networks
• A self-stabilizing algorithm for coloring planar graphs
• A self-stabilizing algorithm for coloring bipartite graphs
• SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS
• A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph
• Models and solution techniques for frequency assignment problems

This page was built for publication: An Efficient Self-stabilizing Distance-2 Coloring Algorithm