Distributed O(Delta log(n))-Edge-Coloring Algorithm

Authors:
Andrzej Czygrinow;M. Handckowiak;Michal Karonski
Affiliations:
-;-;-
Venue:
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Year:
2001

Citing 4
Cited 2

Locality in distributed graph algorithms

SIAM Journal on Computing
A faster distributed algorithm for computing maximal matchings deterministically

Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Fast distributed graph coloring with O(&Dgr;) colors

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Network decomposition and locality in distributed computation

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science

The Local Nature of List Colorings for Graphs of High Girth

SIAM Journal on Computing
Distributed deterministic edge coloring using bounded neighborhood independence

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing

Quantified Score

Hi-index	0.01

Visualization

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).