Skip to main content
Conference Proceedings

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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2161 345-355
DOI: 10.1007/3-540-44676-1_29
18Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Let G = (V,E) be a graph on n vertices and let Δ denote the maximum degree in G. We present a distributed algorithm that finds a O(Δlog n) -edge-coloring of G in time O(log4 n).

Cite

CITATION STYLE

APA

Czygrinow, A., Hańćckowiak, M., & Karoński, M. (2001). Distributed O(Δ log n)-edge-coloring algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2161, pp. 345–355). Springer Verlag. https://doi.org/10.1007/3-540-44676-1_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free