Round and Communication Efficient Graph Coloring

YJ Chang, G Mishra, HT Nguyen, FD Salim - arXiv preprint arXiv …, 2024 - arxiv.org
In the context of communication complexity, we explore randomized protocols for graph
coloring, focusing specifically on the vertex and edge coloring problems in $ n $-vertex …
相关文章

Round and Communication Efficient Graph Coloring

YJ Chang, G Mishra, H Thuan Nguyen… - arXiv e …, 2024 - ui.adsabs.harvard.edu
In the context of communication complexity, we explore randomized protocols for graph
coloring, focusing specifically on the vertex and edge coloring problems in $ n $-vertex …