Distributed edge coloration for bipartite networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4280 LNCS, Issue , 2006, Pages 363-377

  Huang, Shing Tsaan ^a   Tzeng, Chi Hung ^b  

^a NATIONAL CENTRAL UNIVERSITY   (Taiwan)

^b NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

Distributed system; Edge coloring; Fault tolerance; Self stabilization

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; FAULT TOLERANT COMPUTER SYSTEMS; MATHEMATICAL MODELS;

BIPARTITE NETWORKS; EDGE COLORING; SELF STABILIZATION;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33845523133     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-49823-0_26     Document Type: Conference Paper

References (17)

1. Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Communications of the ACM 17 (1974) 643-644
2. Dolev, S.: Self-stabilization. MIT Press (2000)
3. Durand, D., Jain, R., Tseytlin, D.: Parallel I/O scheduling using randomized, distributed edge coloring algorithms. Journal of parallel and distributed computing 63 (2003) 611-618
4. Herman, T., Pirwani, I., Pemmaraju, S.: Oriented edge colorings and link scheduling in sensor networks. In: International Conference on communication Software and Middleware. (2006) 1-6
5. König, D.: Über graphen und ihre anwendung auf determinententheorie und mengenlehre. Math. Ann 77 (1916) 453-465
6. Gabow, H.N., Kariv, O.: Algorithms for edge coloring bipartite graphs. In: Conference of the 10th annual ACM symposium on theory of computing. (1978) 184-192
7. Gabow, H.N., Kariv, O.: Algorithms for edge coloring bipartite graphs and multigraphs. SIAM Journal on Computing 11(1) (1982) 117-129
8. Schrijver, A.: Bipartite edge coloring in O(Δm) time. SIAM Journal on Computing 28 (1999) 841-846
9. Cole, R., Ost, K., Schirra, S.: Edge-coloring bipartite multigraphs in O(E log D) time. Combinatorica 21(1) (2001) 5-12
10. Grable, D., Panconesi, A.: Nearly optimal distributed edge-coloring in O(log log n) rounds. RSA 10(3) (1997) 385-405
11. Panconesi, A., Srinivasan, A.: Fast randomized algorithms for distributed edge coloring. SIAM Journal on Computing. 26(2) (1992) 350-368
12. Sakurai, Y., Ooshita, F., Masuzawa, T.: A self-stabilizing link-coloring protocol resilient to byzantine faults in tree networks. In: OPODIS. (2004) 283-298
13. Masuzawa, T., Tixeuil, S.: A self-stabilizing link coloring algorithm resilient to unbounded byzantine faults in arbitrary networks. Technical report, Laboratoire de Recherche en Informatique (2005)
14. Chattopadhyay, S., Higham, L., Seyffarth, K.: Dynamic and self-stabilizing distributed matching. In: ACM symposium on principles of distributed computing. (2002) 290-297
15. Hsu, S.C., Huang, S.T.: A self-stabilizing algorithm for maximal matching. Information processing letters 24 (1992) 77-81
16. Karaata, M.H., Saleh, K.A.: A distributed self-stabilizing algorithm for finding maximum matching. Computer systems science and engineering 3 (2000) 175-180
17. Rizzi, R.: Konig's edge coloring theorem without augmenting paths. Journal of graph theory 29 (1998) 87