{"paper":{"title":"An Optimal Distributed $(\\Delta+1)$-Coloring Algorithm?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Seth Pettie, Wenzheng Li, Yi-Jun Chang","submitted_at":"2017-11-03T23:46:52Z","abstract_excerpt":"Vertex coloring is one of the classic symmetry breaking problems studied in distributed computing. In this paper we present a new algorithm for $(\\Delta+1)$-list coloring in the randomized ${\\sf LOCAL}$ model running in $O(\\mathsf{Det}_{\\scriptscriptstyle d}(\\text{poly} \\log n))$ time, where $\\mathsf{Det}_{\\scriptscriptstyle d}(n')$ is the deterministic complexity of $(\\text{deg}+1)$-list coloring on $n'$-vertex graphs. (In this problem, each $v$ has a palette of size $\\text{deg}(v)+1$.) This improves upon a previous randomized algorithm of Harris, Schneider, and Su [STOC'16, JACM'18] with com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01361","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}