Work

Round and Communication Efficient Graph Coloring

Year: 2025

Type: conference-paper

Abstract: In the context of communication complexity, we explore protocols for graph coloring, focusing on the vertex and edge coloring problems in n-vertex graphs G with a maximum degree Δ. We consider a scenario where the edges of G are partitioned between two players.

Source: ACM Symposium on Principles of Distributed Computing (PODC)

DOI: 10.1145/3732772.3733508

Authors: Yi-Jun Chang, Gopinath Mishra, Hung Thuan Nguyen, Farrel D Salim

Institution: National University of Singapore

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Funder: Ministry of Education - Singapore

Awards: G1482925484, G474233737