An efficient self-stabilizing distance-2 coloring algorithm

DOI10.1016/J.TCS.2012.01.034MaRDI QIDQ442253zbMATH OpenOpenAlexFDO

Authors Jean R. S. Blair, Fredrik Manne

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

Recommendations

• An efficient self-stabilizing distance-2 coloring algorithm
• A self-stabilizing algorithm for coloring planar graphs
• A self-stabilizing algorithm for coloring bipartite graphs
• A self-stabilizing algorithm for edge-coloring of graphs
• SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS
• A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph
• A self-stabilizing distributed algorithm for edge-coloring general graphs
• Linear time self-stabilizing colorings

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1863300 (Why is no real title available?)
• A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph
• A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems
• A self-stabilizing algorithm for coloring bipartite graphs
• A self-stabilizing algorithm for coloring planar graphs
• A self-stabilizing distributed algorithm for edge-coloring general graphs
• Linear time self-stabilizing colorings
• Models and solution techniques for frequency assignment problems
• SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS
• Self-stabilizing coloration in anonymous planar networks

Cited in

(7)

• Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs
• An efficient self-stabilizing distance-2 coloring algorithm
• A self-stabilizing algorithm for \(b\)-matching
• Linear time self-stabilizing colorings
• Self-stabilizing algorithms for minimal global powerful alliance sets in graphs
• A fault-containing self-stabilizing algorithm for 6-coloring planar graphs
• Efficient transformation of distance-2 self-stabilizing algorithms

Describes a project that uses

Uses Software

• CALMA

This page was built for publication: An efficient self-stabilizing distance-2 coloring algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442253)