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

A. Czygrinow, M. Hańćckowiak, M. Karoński

Research output: Chapter in Book/Report/Conference proceedingConference contribution

16 Scopus citations


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

Original languageEnglish (US)
Title of host publicationAlgorithms - ESA 2001 - 9th Annual European Symposium, Proceedings
EditorsFriedhelm Meyer auf der Heide
PublisherSpringer Verlag
Number of pages11
ISBN (Print)9783540424932
StatePublished - Jan 1 2001
Event9th Annual European Symposium on Algorithms, ESA 2001 - Arhus, Denmark
Duration: Aug 28 2001Aug 31 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other9th Annual European Symposium on Algorithms, ESA 2001

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Distributed O(Δ log n)-edge-coloring algorithm'. Together they form a unique fingerprint.

Cite this