| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428887 | Information Processing Letters | 2007 | 6 Pages |
Abstract
This paper proposes a self-stabilizing edge-coloring algorithm using (Δ+4) colors for distributed systems of a planar graph topology, where Δ⩾5 is the maximum degree of the graph. The algorithm can be applied to anonymous uniform systems and its time complexity is O(n2) moves under the central daemon model.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
