Brief Announcement: List Defective Colorings: Distributed Algorithms and Applications-Reference-Cited by-同舟云学术

Brief Announcement: List Defective Colorings: Distributed Algorithms and Applications

Published:2023-06-17 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures
language:
Short-container-title:

Author:

Fuchs Marc¹^ORCID,Kuhn Fabian¹^ORCID

Affiliation:

1. University of Freiburg, Freiburg, Germany

Funder

German Research Foundation

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3558481.3591319

Reference23 articles.

1. Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic, and Faulty Networks

2. Leonid Barenboim and Michael Elkin . 2009 . Distributed (delta1)-coloring in linear (in delta) time . In Proc. 41st Annual ACM Symp. on Theory of Computing (STOC). 111--120 . Leonid Barenboim and Michael Elkin. 2009. Distributed (delta1)-coloring in linear (in delta) time. In Proc. 41st Annual ACM Symp. on Theory of Computing (STOC). 111--120.

3. Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition

4. Deterministic Distributed Vertex Coloring in Polylogarithmic Time

5. Leonid Barenboim , Michael Elkin , and Uri Goldenberg . 2018 . Locally-Iterative Distributed (Δ 1)-Coloring below Szegedy-Vishwanathan Barrier, and Applications to Self-Stabilization and to Restricted-Bandwidth Models . In Proc. 37th ACM Symp. on Principles of Distributed Computing (PODC). 437--446 . Leonid Barenboim, Michael Elkin, and Uri Goldenberg. 2018. Locally-Iterative Distributed (Δ 1)-Coloring below Szegedy-Vishwanathan Barrier, and Applications to Self-Stabilization and to Restricted-Bandwidth Models. In Proc. 37th ACM Symp. on Principles of Distributed Computing (PODC). 437--446.