𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A self-stabilizing algorithm for coloring bipartite graphs

✍ Scribed by Sumit Sur; Pradip K. Srimani

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
566 KB
Volume
69
Category
Article
ISSN
0020-0255

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Self-Stabilizing Leader Election Algor
A Self-Stabilizing Leader Election Algorithm for Tree Graphs
✍ Gheorghe Antonoiu; Pradip K. Srimani πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 231 KB

We propose a self-stabilizing algorithm (protocol) for leader election in a tree graph. We show the correctness of the proposed algorithm by using a new technique involving induction.

Star coloring bipartite planar graphs
Star coloring bipartite planar graphs
✍ H. A. Kierstead; AndrΓ© KΓΌndgen; Craig Timmons πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 139 KB

## Abstract A __star coloring__ of a graph is a proper vertex‐coloring such that no path on four vertices is 2‐colored. We prove that the vertices of every bipartite planar graph can be star colored from lists of size 14, and we give an example of a bipartite planar graph that requires at least eig

Efficient parallel algorithms for bipart
Efficient parallel algorithms for bipartite permutation graphs
✍ Lin Chen; Yaacov Yesha πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 858 KB

## Abstract In this paper, we further study the properties of bipartite permutation graphs. We give first efficient parallel algorithms for several problems on bipartite permutation graphs. These problems include transforming a bipartite graph into a strongly ordered one if it is also a permutation