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).
This work was supported by KBN GRANT 7 T11C 032 20
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
N. Linial, Locality in distributed graph algorithms, SIAM Journal on Computing, 1992, 21(1), pp. 193–201.
G. De Marco, A. Pelc, Fast distributed graph coloring with O(Δ) colors, SODA 2001.
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.
B. Awerbuch, A.V. Goldberg, M. Luby, and S. Plotkin, Network decomposition and locality in distributed computing, Proceedings of the 30th Symposium on Foundations of Computer Science (FOCS 1989), pp. 364–369.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Czygrinow, A., Hańćkowiak, M., Karoński, M. (2001). Distributed O(Δ log n)-Edge-Coloring Algorithm. In: auf der Heide, F.M. (eds) Algorithms — ESA 2001. ESA 2001. Lecture Notes in Computer Science, vol 2161. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44676-1_29
Download citation
DOI: https://doi.org/10.1007/3-540-44676-1_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42493-2
Online ISBN: 978-3-540-44676-7
eBook Packages: Springer Book Archive