Brief Announcement
From MaRDI portal
Publication:5361934
DOI10.1145/2933057.2933079zbMath1373.68258arXiv1602.08166MaRDI QIDQ5361934
Tsvi Kopelowitz, Seth Pettie, Yi-Jun Chang
Publication date: 29 September 2017
Published in: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.08166
68Q25: Analysis of algorithms and problem complexity
05C15: Coloring of graphs and hypergraphs
68W20: Randomized algorithms
68W15: Distributed algorithms
Related Items
A Time Hierarchy Theorem for the LOCAL Model, Almost global problems in the LOCAL model, Network Decomposition and Distributed Derandomization (Invited Paper), Distributed Recoloring, How long it takes for an ordinary node with an ordinary ID to output?, Local approximation of the maximum cut in regular graphs, Distributed algorithms for the Lovász local lemma and graph coloring, Node and edge averaged complexities of local graph problems, Computing large independent sets in a single round, Improved distributed \(\Delta\)-coloring, Local mending, What can be sampled locally?, Improved deterministic distributed matching via rounding, Derandomizing local distributed algorithms under bandwidth restrictions, Optimal distributed covering algorithms