Distributed O(Δ log n)-edge-coloring algorithm

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

Volumn 2161, Issue , 2001, Pages 345-355

  Czygrinow, A ^a,b   Hancckowiak M ^a   Karonski M ^a,c  

^a ADAM MICKIEWICZ UNIVERSITY   (Poland)

^b ARIZONA STATE UNIVERSITY   (United States)

^c EMORY UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

EDGE COLORING; EDGE-COLORING ALGORITHMS; MAXIMUM DEGREE;

ARTIFICIAL INTELLIGENCE;

EID: 84938263617     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44676-1_29     Document Type: Conference Paper

References (4)

1. N. Linial, Locality in distributed graph algorithms, SIAM Journal on Com-puting, 1992, 21(1), pp. 193-201.
2. G. De Marco, A. Pelc, Fast distributed graph coloring with O(Δ) colors, SODA 2001.
3. M. Hańćkowiak, M. Karoński, A. Panconesi, A faster distributed algorithm for computing maximal matching deterministically, Proceedings of PODC 99, the Eighteen Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 219-228.
4. B. Awerbuch, A.V. Goldberg, M. Luby, and S. Plotkin, Network decompo-sition and locality in distributed computing, Proceedings of the 30th Sym-posium on Foundations of Computer Science (FOCS 1989), pp. 364-369.