Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Distributed edge coloration for bipartite networks

Distributed edge coloration for bipartite networks This paper presents a self-stabilizing algorithm to color the edges of a bipartite network such that any two adjacent edges receive distinct colors. The algorithm has the self-stabilizing property; it works without initializing the system. It also works in a de-centralized way without a leader computing a proper coloring for the whole system. Moreover, it finds an optimal edge coloring and its time complexity is O(n 2 k + m) moves, where k is the number of edges that are not properly colored in the initial configuration. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Distributed Computing Springer Journals

Distributed edge coloration for bipartite networks

Distributed Computing , Volume 22 (1) – Jun 19, 2009

Loading next page...
 
/lp/springer-journals/distributed-edge-coloration-for-bipartite-networks-WtxWiEr0xS

References (32)

Publisher
Springer Journals
Copyright
Copyright © 2009 by Springer-Verlag
Subject
Computer Science; Theory of Computation; Software Engineering/Programming and Operating Systems; Computer Systems Organization and Communication Networks; Computer Hardware; Computer Communication Networks
ISSN
0178-2770
eISSN
1432-0452
DOI
10.1007/s00446-009-0082-8
Publisher site
See Article on Publisher Site

Abstract

This paper presents a self-stabilizing algorithm to color the edges of a bipartite network such that any two adjacent edges receive distinct colors. The algorithm has the self-stabilizing property; it works without initializing the system. It also works in a de-centralized way without a leader computing a proper coloring for the whole system. Moreover, it finds an optimal edge coloring and its time complexity is O(n 2 k + m) moves, where k is the number of edges that are not properly colored in the initial configuration.

Journal

Distributed ComputingSpringer Journals

Published: Jun 19, 2009

There are no references for this article.