Self-stabilizing Algorithms for Graph Coloring with Improved Performance Guarantees


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… (More)
DOI: 10.1007/11785231_120


1 Figure or Table


Citations per Year

Citation Velocity: 7

Averaging 7 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Cite this paper

@inproceedings{Kosowski2006SelfstabilizingAF, title={Self-stabilizing Algorithms for Graph Coloring with Improved Performance Guarantees}, author={Adrian Kosowski and Lukasz Kuszner}, booktitle={ICAISC}, year={2006} }