A self-stabilizing algorithm for coloring bipartite graphs (Q1803195): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A self-stabilizing algorithm for constructing spanning trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Self-stabilizing systems in spite of distributed control / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A belated proof of self-stabilization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An exercise in proving self-stabilization with a variant function / rank | |||
Normal rank | |||
Latest revision as of 16:43, 17 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A self-stabilizing algorithm for coloring bipartite graphs |
scientific article |
Statements
A self-stabilizing algorithm for coloring bipartite graphs (English)
0 references
29 June 1993
0 references
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}\).
0 references
self-stabilizing algorithm
0 references
vertex coloring
0 references
bipartite graphs
0 references
