A belated proof of self-stabilization
Distributed Computing
A self-stabilizing algorithm for coloring bipartite graphs
Information Sciences: an International Journal
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Stabilization-Preserving Atomicity Refinement
Proceedings of the 13th International Symposium on Distributed Computing
Self-Stabilizing Local Mutual Exclusion and Daemon Refinement
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
A self-stabilizing algorithm for coloring planar graphs
Distributed Computing - Special issue: Self-stabilization
Weighted coloring based channel assignment for WLANs
ACM SIGMOBILE Mobile Computing and Communications Review
PEDAMACS: Power Efficient and Delay Aware Medium Access Protocol for Sensor Networks
IEEE Transactions on Mobile Computing
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
TDMA scheduling algorithms for wireless sensor networks
Wireless Networks
| Hi-index | 0.00 |
We propose two new self-stabilizing distributed algorithms for proper 驴+1 (驴is the maximum degree of a node in the graph) coloring of arbitrary system graphs. Both algorithms are capable of working with multiple types of demons (schedulers) as is the most recent algorithm in [1]. The first algorithm converges in O(m) moves while the second converges in at most n moves (n is the number of nodes and m is the number of edges in the graph) as opposed to the O(驴 脳 n) moves required by the algorithm [1]. The second improvement is that neither of the proposed algorithms requires each node to have knowledge of 驴, as is required in [1]. Further, the coloring produced by our first algorithm provides an interesting special case of coloring, e.g., Grundy Coloring [2].