A self-stabilizing algorithm for coloring bipartite graphs (Q1803195)

From MaRDI portal
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
    0 references
    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
    0 references
    self-stabilizing algorithm
    0 references
    vertex coloring
    0 references
    bipartite graphs
    0 references

    Identifiers