Distributed edge coloration for bipartite networks

Authors:
Shing-Tsaan Huang;Chi-Hung Tzeng
Affiliations:
National Central University, Chung-Li, Taiwan;National Tsing Hua University, Hsin-Chu, Taiwan
Venue:
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Year:
2006

Citing 10
Cited 1

A self-stabilizing algorithm for maximal matching

Information Processing Letters
Nearly optimal distributed edge coloring in O(log log n) rounds

Random Structures & Algorithms
Bipartite Edge Coloring in $O(\Delta m)$ Time

SIAM Journal on Computing
Self-stabilization

Self-stabilization
Self-stabilizing systems in spite of distributed control

Communications of the ACM
Dynamic and self-stabilizing distributed matching

Proceedings of the twenty-first annual symposium on Principles of distributed computing
Algorithms for edge coloring bipartite graphs

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Parallel I/O scheduling using randomized, distributed edge coloring algorithms

Journal of Parallel and Distributed Computing
König's edge coloring theorem without augmenting paths

Journal of Graph Theory
A self-stabilizing link-coloring protocol resilient to byzantine faults in tree networks

OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems

A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper develops a distributed algorithm to color the edges of a bipartite network in such a way that any two adjacent edges receive distinct colors. The algorithm has the self-stabilizing property. It works with an arbitrary initialization. Its execution model is assumed to be the central daemon, and its time complexity is O(n2m) moves, where n and m are the number of nodes and the number of edges, respectively.