Self-stabilizing algorithms for graph coloring with improved performance guarantees

Authors:
Adrian Kosowski;Łukasz Kuszner
Affiliations:
Department of Algorithms and System Modeling, Gdańsk University of Technology, Poland;Department of Algorithms and System Modeling, Gdańsk University of Technology, Poland
Venue:
ICAISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Soft Computing
Year:
2006

Citing 10
Cited 5

A self-stabilizing algorithm for coloring bipartite graphs

Information Sciences: an International Journal
Distributed code assignments for CDMA Packet Radio Network

IEEE/ACM Transactions on Networking (TON)
Assigning codes in wireless networks: bounds and scaling properties

Wireless Networks
Self-stabilization

Self-stabilization
Self-stabilizing systems in spite of distributed control

Communications of the ACM
Capacity of Ad Hoc wireless networks

Proceedings of the 7th annual international conference on Mobile computing and networking
Linear time self-stabilizing colorings

Information Processing Letters
A self-stabilizing algorithm for coloring planar graphs

Distributed Computing - Special issue: Self-stabilization
Self-stabilizing coloration in anonymous planar networks

Information Processing Letters
A self-stabilizing algorithm for finding a spanning tree in a polynomial number of moves

PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics

Self-stabilizing Cuts in Synchronous Networks

SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs

Journal of Parallel and Distributed Computing
A self-stabilizing algorithm for cut problems in synchronous networks

Theoretical Computer Science
An efficient self-stabilizing distance-2 coloring algorithm

SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
An efficient self-stabilizing distance-2 coloring algorithm

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the self-stabilizing model we consider a connected system of autonomous asynchronous nodes, each of which has only local information about the system. Regardless of the initial state, the system must achieve a desirable global state by executing a set of rules assigned to each node. The paper deals with the construction of a solution to graph coloring in this model, a problem motivated by code assignment in wireless networks. A new method based on spanning trees is applied to give the first (to our knowledge) self-stabilizing algorithms working in a polynomial number of moves, which color bipartite graphs with exactly two colors. The complexity and performance characteristics of the presented algorithms are discussed for different graph classes.