TY - GEN

T1 - Polynomial lower bound for distributed graph coloring in a weak LOCAL model

AU - Hefetz, Dan

AU - Kuhn, Fabian

AU - Maus, Yannic

AU - Steger, Angelika

N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2016.

PY - 2016

Y1 - 2016

N2 - We show an Ω(formula presented) lower bound on the runtime of any deterministic distributed O(Δ1+η)-graph coloring algorithm in a weak variant of the LOCAL model. In particular, given a network graph G = (V,E), in the weak LOCAL model nodes communicate in synchronous rounds and they can use unbounded local computation. The nodes have no identifiers, but instead, the computation starts with an initial valid vertex coloring. A node can broadcast a single message of unbounded size to its neighbors and receives the set of messages sent to it by its neighbors. The proof uses neighborhood graphs and improves their understanding in general such that it might help towards finding a lower (runtime) bound for distributed graph coloring in the standard LOCAL model.

AB - We show an Ω(formula presented) lower bound on the runtime of any deterministic distributed O(Δ1+η)-graph coloring algorithm in a weak variant of the LOCAL model. In particular, given a network graph G = (V,E), in the weak LOCAL model nodes communicate in synchronous rounds and they can use unbounded local computation. The nodes have no identifiers, but instead, the computation starts with an initial valid vertex coloring. A node can broadcast a single message of unbounded size to its neighbors and receives the set of messages sent to it by its neighbors. The proof uses neighborhood graphs and improves their understanding in general such that it might help towards finding a lower (runtime) bound for distributed graph coloring in the standard LOCAL model.

KW - Color reduction

KW - Distributed graph coloring

KW - Distributed symmetry breaking

KW - LOCAL model

KW - Lower bound

KW - Neighborhood graphs

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

U2 - 10.1007/978-3-662-53426-7_8

DO - 10.1007/978-3-662-53426-7_8

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84988644316

SN - 9783662534250

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

SP - 99

EP - 113

BT - Distributed Computing - 30th International Symposium, DISC 2016, Proceedings

A2 - Gavoille, Cyril

A2 - Ilcinkas, David

T2 - 30th International Symposium on Distributed Computing, DISC 2016

Y2 - 27 September 2016 through 29 September 2016

ER -