A self-stabilizing ( Δ + 4 )-edge-coloring algorithm for planar graphs in anonymous uniform systems

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 ( n 2 ) moves under the cen...

Full description

Saved in:
Bibliographic Details
Published inInformation processing letters Vol. 101; no. 4; pp. 168 - 173
Main Authors Tzeng, Chi-Hung, Jiang, Jehn-Ruey, Huang, Shing-Tsaan
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 28.02.2007
Elsevier Science
Elsevier Sequoia S.A
Subjects
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Combinatorics
Combinatorics. Ordered structures
Computer science; control theory; systems
Distributed systems
Edge coloring
Exact sciences and technology
Graph theory
Graphs
Mathematics
Planar graphs
Sciences and techniques of general use
Self-stabilization
Studies
Theoretical computing
Topology
Self-stabilization
Distributed systems
Edge coloring
Planar graphs
Computer theory
Planar graph
Distributed system
Topology
Graph degree
Graph colouring
Time complexity
Algorithm analysis
Graph algorithm
Online AccessGet full text
ISSN0020-0190
1872-6119
DOI10.1016/j.ipl.2006.09.004

Cover

More Information
Summary: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 ( n 2 ) moves under the central daemon model.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2006.09.004