A self-stabilizing algorithm for coloring bipartite graphs

DOI10.1016/0020-0255(93)90121-2zbMath0779.05053OpenAlexW2064536265MaRDI QIDQ1803195

Pradip K. Srimani, Sumit Sur

Publication date: 29 June 1993

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(93)90121-2

zbMATH Keywords

bipartite graphsvertex coloringself-stabilizing algorithm

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)

Related Items (9)

Self-stabilizing algorithms for minimal dominating sets and maximal independent sets ⋮ An efficient self-stabilizing distance-2 coloring algorithm ⋮ A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs ⋮ Improved self-stabilizing algorithms for \(L(2, 1)\)-labeling tree networks ⋮ Timer-based composition of fault-containing self-stabilizing protocols ⋮ A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph ⋮ A self-stabilizing algorithm for detecting fundamental cycles in a graph ⋮ Linear time self-stabilizing colorings ⋮ An Efficient Self-stabilizing Distance-2 Coloring Algorithm

Cites Work

• A belated proof of self-stabilization
• An exercise in proving self-stabilization with a variant function
• A self-stabilizing algorithm for constructing spanning trees
• Self-stabilizing systems in spite of distributed control

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