An efficient self-stabilizing distance-2 coloring algorithm

DOI10.1016/J.TCS.2012.01.034zbMath1246.68168OpenAlexW2176143798MaRDI QIDQ442253

Fredrik Manne, Jean R. S. Blair

Publication date: 10 August 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.01.034

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (4)

A self-stabilizing algorithm for \(b\)-matching ⋮ Self-stabilizing algorithms for minimal global powerful alliance sets in graphs ⋮ Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs ⋮ A new self-stabilizing maximal matching algorithm

Uses Software

• CALMA

Cites Work

• Unnamed Item
• 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