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

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

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

15 Scopus citations

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

Original languageEnglish (US)
Title of host publicationAlgorithms - ESA 2001 - 9th Annual European Symposium, Proceedings
EditorsFriedhelm Meyer auf der Heide
PublisherSpringer Verlag
Pages345-355
Number of pages11
ISBN (Print)9783540424932
DOIs
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)
Volume2161
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other9th Annual European Symposium on Algorithms, ESA 2001
CountryDenmark
CityArhus
Period8/28/018/31/01

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

    Czygrinow, A., Hańćckowiak, M., & Karoński, M. (2001). Distributed O(Δ log n)-edge-coloring algorithm. In F. M. auf der Heide (Ed.), Algorithms - ESA 2001 - 9th Annual European Symposium, Proceedings (pp. 345-355). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2161). Springer Verlag. https://doi.org/10.1007/3-540-44676-1_29