A self-stabilizing algorithm for coloring bipartite graphs
Information Sciences: an International Journal
Self-stabilizing Neighborhood Unique Naming under Unfair Scheduler
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Linear time self-stabilizing colorings
Information Processing Letters
A self-stabilizing algorithm for coloring planar graphs
Distributed Computing - Special issue: Self-stabilization
A self-stabilizing (Δ+4)-edge-coloring algorithm for planar graphs in anonymous uniform systems
Information Processing Letters
Self-stabilizing coloration in anonymous planar networks
Information Processing Letters
A self-stabilizing algorithm for the minimum color sum of a graph
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Distance-k information in self-stabilizing algorithms
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Self-stabilizing algorithms for graph coloring with improved performance guarantees
ICAISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Soft Computing
Efficient transformation of distance-2 self-stabilizing algorithms
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
We present a self-stabilizing algorithm for the distance-2 coloring problem that uses a constant number of variables on each node and that stabilizes in O(Δ2m) moves using at most Δ2+1 colors, where Δ is the maximum degree in the graph and m is the number of edges in the graph. The analysis holds true both for the sequential and the distributed adversarial daemon model. This should be compared with the previous best self-stabilizing algorithm for this problem which stabilizes in O(nm) moves under the sequential adversarial daemon and in O(n3m) time steps for the distributed adversarial daemon and which uses O(δi) variables on each node i, where δi is the degree of node i.