Access the full text.
Sign up today, get DeepDyve free for 14 days.
E. Dijkstra (1974)
Self-stabilizing systems in spite of distributed controlCommun. ACM, 17
S. Kutten, B. Patt-Shamir (1999)
Stabilizing Time-Adaptive ProtocolsTheor. Comput. Sci., 220
E. Emerson (1987)
Uniform Inevitability is Tree Automaton IneffableInf. Process. Lett., 24
M. Mizuno, Mikhail Nesterenko (1998)
A Transformation of Self-Stabilizing Serial Model Programs for Asynchronous Parallel Computing EnvironmentsInf. Process. Lett., 66
David Grable, A. Panconesi (1997)
Nearly optimal distributed edge coloring in O (log log n ) roundsRandom Structures and Algorithms, 10
D. Durand, R. Jain, D. Tseytlin (2003)
Parallel I/O scheduling using randomized, distributed edge coloring algorithmsJ. Parallel Distributed Comput., 63
H. Gabow, O. Kariv (1982)
Algorithms for Edge Coloring Bipartite Graphs and MultigraphsSIAM J. Comput., 11
S. Dolev, A. Israeli, S. Moran (1990)
Self-stabilization of dynamic systems assuming only read/write atomicityDistributed Computing, 7
(2006)
Distributed edge coloration for bipartite networks
S. Gandham, Milind Dawande, R. Prakash (2008)
Link scheduling in wireless sensor networks: Distributed edge-coloring revisitedJ. Parallel Distributed Comput., 68
A. Panconesi, A. Srinivasan (1997)
Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding BoundsSIAM J. Comput., 26
Subhendu Chattopadhyay, L. Higham, K. Seyffarth (2002)
Dynamic and self-stabilizing distributed matching
Romeo Rizzi (1998)
König's edge coloring theorem without augmenting pathsJ. Graph Theory, 29
Su-Chu Hsu, Shing-Tsaan Huang (1992)
A Self-Stabilizing Algorithm for Maximal MatchingInf. Process. Lett., 43
H. Gabow, O. Kariv (1978)
Algorithms for edge coloring bipartite graphsProceedings of the tenth annual ACM symposium on Theory of computing
Y. Katayama, Eiichiro Ueda, H. Fujiwara, T. Masuzawa (2002)
A Latency Optimal Superstabilizing Mutual Exclusion Protocol in Unidirectional RingsJ. Parallel Distributed Comput., 62
Chi-Hung Tzeng, Jehn-Ruey Jiang, Shing-Tsaan Huang (2007)
A self-stabilizing (Delta+4)-edge-coloring algorithm for planar graphs in anonymous uniform systemsInf. Process. Lett., 101
A. Schrijver (1999)
Bipartite edge-colouring in O( m) time1SIAM Journal on Computing
T. Masuzawa, S. Tixeuil (2007)
Stabilizing Link-Coloration of Arbitrary Networks with Unbounded Byzantine Faults, 1
S. Dolev (2004)
Self StabilizationJ. Aerosp. Comput. Inf. Commun., 1
S. Dolev, T. Herman (2007)
Parallel composition for time-to-fault adaptive stabilizationDistributed Computing, 20
Chi-Hung Tzeng, Shing-Tsaan Huang (2008)
A Self-Stabilizing ( Δ + 4 )-Edge-Coloring Algorithm for Planar Graphs in Anonymous Uniform Systems
T. Herman, S. Pemmaraju, I. Pirwani (2006)
Oriented Edge Colorings and Link Scheduling in Sensor Networks2006 1st International Conference on Communication Systems Software & Middleware
Yusuke Sakurai, Fukuhito Ooshita, T. Masuzawa (2004)
A Self-stabilizing Link-Coloring Protocol Resilient to Byzantine Faults in Tree Networks
D. König (1916)
Über Graphen und ihre Anwendung auf Determinantentheorie und MengenlehreMathematische Annalen, 77
R. Graham, D. Knuth, Oren Patashnik (1991)
Concrete mathematics - a foundation for computer science
T. Masuzawa, S. Tixeuil (2006)
On bootstrapping topology knowledge in anonymous networks
R. Cole, Kirstin Ost, S. Schirra (1999)
Edge-Coloring Bipartite Multigraphs in O(E logD) TimeCombinatorica, 21
A. Schrijver (1999)
Bipartite Edge Coloring in O(Delta m) TimeSIAM J. Comput., 28
A. Panconesi, A. Srinivasan (1992)
Fast randomized algorithms for distributed edge coloring
T. Masuzawa, S. Tixeuil (2005)
A Self-stabilizing Link-Coloring Protocol Resilient to Unbounded Byzantine Faults in Arbitrary Networks
M. Potop-Butucaru, S. Tixeuil (2007)
Conflict Managers for Self-stabilization without Fairness Assumption27th International Conference on Distributed Computing Systems (ICDCS '07)
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.
Distributed Computing – Springer Journals
Published: Jun 19, 2009
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.