A Self-Stabilizing Distance-2 Edge Coloring Algorithm

In this paper, we propose a self-stabilizing distance-2 edge coloring algorithm for arbitrary graphs. The algorithm operates correctly under the distributed model and guarantees that two edges within distance 2 of each other receive distinct colors when the system stabilizes. It uses 2... (... - 1)...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computer journal 2014-11, Vol.57 (11), p.1639-1648
Hauptverfasser: Lee, C.-L., Liu, T.-J.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we propose a self-stabilizing distance-2 edge coloring algorithm for arbitrary graphs. The algorithm operates correctly under the distributed model and guarantees that two edges within distance 2 of each other receive distinct colors when the system stabilizes. It uses 2... (... - 1) + 1 colors and stabilizes in 4n + (2... (... - 1) + 2)m rounds, where n,m, respectively, denote the number of nodes and edges and ... is the maximum degree of nodes in the graph. (ProQuest: ... denotes formulae/symbols omitted.)
ISSN:0010-4620
1460-2067
DOI:10.1093/comjnl/bxt072