Self-stabilizing coloration in anonymous planar networks

DOI10.1016/J.IPL.2005.03.005zbMath1185.68030OpenAlexW2046563089MaRDI QIDQ1041773

Shing-Tsaan Huang, Chi-Hung Tzeng, Su-Shen Hung

Publication date: 4 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.03.005

zbMATH Keywords

fault tolerancegraph algorithmsvertex coloringplanar graphself-stabilizationgrundy coloring

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems ⋮ Self-stabilizing Cuts in Synchronous Networks ⋮ An efficient self-stabilizing distance-2 coloring algorithm ⋮ A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs ⋮ A self-stabilizing algorithm for cut problems in synchronous networks ⋮ A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph ⋮ An Efficient Self-stabilizing Distance-2 Coloring Algorithm

Cites Work

• Unnamed Item
• Linear time self-stabilizing colorings
• A self-stabilizing algorithm for coloring planar graphs
• Self-stabilizing systems in spite of distributed control
• 25 pretty graph colouring problems

This page was built for publication: Self-stabilizing coloration in anonymous planar networks