A self-stabilizing algorithm for coloring bipartite graphs
type: Item
instance of: scholarly article
title: A self-stabilizing algorithm for coloring bipartite graphs
zbMATH Open document ID: 0779.05053
DOI: 10.1016/0020-0255(93)90121-2
author: Sumit Sur
author: Pradip K. Srimani
published in: Information Sciences
publication date: 1993-06-29T00:00:00Z
review text: The term self-stabilizing was introduced by \textit{E. W. Dijkstra} [Commun. ACM 17, 643-644 (1974; Zbl 0305.68048)]. The authors present a self- stabilizing algorithm for vertex coloring bipartite graphs. They also illustrate the execution of the algorithm on an example of \(K_{4,4}\).
reviewed by: J.Sedláček
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 220437
zbMATH Keywords: self-stabilizing algorithm
zbMATH Keywords: vertex coloring
zbMATH Keywords: bipartite graphs
MaRDI profile type: Publication
full work available at URL: 0020-0255(93)90121-2
OpenAlex ID: W2064536265
cites work: A self-stabilizing algorithm for constructing spanning trees
cites work: Self-stabilizing systems in spite of distributed control
cites work: A belated proof of self-stabilization
cites work: An exercise in proving self-stabilization with a variant function
description: scientific article; zbMATH DE number 220437