A self-stabilizing algorithm for edge-coloring of graphs

MaRDI QIDQ3070908zbMATH OpenFDO

Authors Łukasz Kuszner, Adam Nadolski

Publication date 28 January 2011

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15) Distributed algorithms (68W15)

Recommendations

• A self-stabilizing distributed algorithm for edge-coloring general graphs
• A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems
• scientific article; zbMATH DE number 1875427
• Distributed edge coloration for bipartite networks
• Fast distributed graph coloring with \(O(\Delta)\) colors

Cited in

(11)

• A fault-containing self-stabilizing algorithm for 6-coloring planar graphs
• An efficient self-stabilizing distance-2 coloring algorithm
• SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS
• An efficient self-stabilizing distance-2 coloring algorithm
• 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
• Linear time self-stabilizing colorings
• Distributed edge coloration for bipartite networks
• A self-stabilizing algorithm for coloring planar graphs
• A self-stabilizing algorithm for coloring bipartite graphs
• A self-stabilizing distributed algorithm for edge-coloring general graphs

This page was built for publication: A self-stabilizing algorithm for edge-coloring of graphs

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