Round and Communication Efficient Graph Coloring
Yi-Jun Chang, Gopinath Mishra, Hung Thuan Nguyen, Farrel D Salim

TL;DR
This paper introduces communication-efficient randomized and deterministic protocols for graph coloring problems, significantly reducing round complexity and establishing lower bounds in distributed and streaming models.
Contribution
It presents a randomized protocol for vertex coloring with fewer rounds and a deterministic protocol for edge coloring with tight lower bounds, advancing communication complexity in graph coloring.
Findings
Randomized protocol achieves $( ext{max degree}+1)$-vertex coloring with $O(n)$ bits and $O(rac{ ext{log log n} imes ext{log} ext{Delta})$ rounds.
Deterministic protocol computes $(2 ext{Delta}-1)$-edge coloring with $O(n)$ bits and $O(1)$ rounds.
Established an $ ilde{ ext{Omega}}(n)$ lower bound on communication complexity for edge coloring in streaming models.
Abstract
In the context of communication complexity, we explore protocols for graph coloring, focusing on the vertex and edge coloring problems in -vertex graphs with a maximum degree . We consider a scenario where the edges of are partitioned between two players. Our first contribution is a randomized protocol that efficiently finds a -vertex coloring of , utilizing bits of communication in expectation and completing in rounds in the worst case. This advancement represents a significant improvement over the work of Flin and Mittal [Distributed Computing 2025], who achieved the same communication cost but required rounds in expectation, thereby making a significant reduction in the round complexity. Our second contribution is a deterministic protocol to compute a -edge coloring of , which…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · Advanced Graph Theory Research
