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

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

doi:10.1007/3-540-44676-1_29

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

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

Mathematical and Statistical Sciences, School of (SoMSS)

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

18 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(log⁴ n).

Original language	English (US)
Title of host publication	Algorithms - ESA 2001 - 9th Annual European Symposium, Proceedings
Editors	Friedhelm Meyer auf der Heide
Publisher	Springer Verlag
Pages	345-355
Number of pages	11
ISBN (Print)	9783540424932
DOIs	https://doi.org/10.1007/3-540-44676-1_29
State	Published - Jan 1 2001
Event	9th Annual European Symposium on Algorithms, ESA 2001 - Arhus, Denmark Duration: Aug 28 2001 → Aug 31 2001

Publication series

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

Other

Other	9th Annual European Symposium on Algorithms, ESA 2001
Country/Territory	Denmark
City	Arhus
Period	8/28/01 → 8/31/01

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/3-540-44676-1_29

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

Distributed O(Δ log n)-edge-coloring algorithm. / Czygrinow, A.; Hańćckowiak, M.; Karoński, M.
Algorithms - ESA 2001 - 9th Annual European Symposium, Proceedings. ed. / Friedhelm Meyer auf der Heide. Springer Verlag, 2001. p. 345-355 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2161).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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

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

Czygrinow, A. ; Hańćckowiak, M. ; Karoński, M. / Distributed O(Δ log n)-edge-coloring algorithm. Algorithms - ESA 2001 - 9th Annual European Symposium, Proceedings. editor / Friedhelm Meyer auf der Heide. Springer Verlag, 2001. pp. 345-355 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{bad551fcf54f4a6ebbd4eac6d027d0fe,

title = "Distributed O(Δ log n)-edge-coloring algorithm",

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

author = "A. Czygrinow and M. Ha{\'n}{\'c}ckowiak and M. Karo{\'n}ski",

year = "2001",

month = jan,

day = "1",

doi = "10.1007/3-540-44676-1_29",

language = "English (US)",

isbn = "9783540424932",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "345--355",

editor = "{auf der Heide}, {Friedhelm Meyer}",

booktitle = "Algorithms - ESA 2001 - 9th Annual European Symposium, Proceedings",

note = "9th Annual European Symposium on Algorithms, ESA 2001 ; Conference date: 28-08-2001 Through 31-08-2001",

}

TY - GEN

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

AU - Czygrinow, A.

AU - Hańćckowiak, M.

AU - Karoński, M.

PY - 2001/1/1

Y1 - 2001/1/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=84938263617&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84938263617&partnerID=8YFLogxK

U2 - 10.1007/3-540-44676-1_29

DO - 10.1007/3-540-44676-1_29

M3 - Conference contribution

AN - SCOPUS:84938263617

SN - 9783540424932

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 345

EP - 355

BT - Algorithms - ESA 2001 - 9th Annual European Symposium, Proceedings

A2 - auf der Heide, Friedhelm Meyer

PB - Springer Verlag

T2 - 9th Annual European Symposium on Algorithms, ESA 2001

Y2 - 28 August 2001 through 31 August 2001

ER -

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

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this