An Efficient Self-stabilizing Distance-2 Coloring Algorithm


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(Δm) moves using at most Δ + 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… (More)
DOI: 10.1007/978-3-642-11476-2_19


3 Figures and Tables

Cite this paper

@article{Blair2009AnES, title={An Efficient Self-stabilizing Distance-2 Coloring Algorithm}, author={Jean R. S. Blair and Fredrik Manne}, journal={Theor. Comput. Sci.}, year={2009}, volume={444}, pages={28-39} }