5 papers
Communication-Efficient -Edge Coloring and Lovász Local Lemma
Yi-Jun Chang, Nima Dolatabadi, Hung Thuan Nguyen
We study edge coloring in the two-party edge-partition model, where Alice and Bob each know part of the edge set and must jointly produce a proper coloring with little communicatio…
The Complexity of Distributed Minimum Weight Cycle Approximation
Yi-Jun Chang, Yanyu Chen, Dipan Dey +4
We study the Minimum Weight Cycle (MWC) problem in the model of distributed computing. For undirected weighted graphs, we give a randomized -approximation…
Optimal Distributed Replacement Paths
Yi-Jun Chang, Yanyu Chen, Dipan Dey +3
We study the replacement paths problem in the model of distributed computing. Given an - shortest path , the goal is to compute, for every edge in $…
Round and Communication Efficient Graph Coloring
Yi-Jun Chang, Gopinath Mishra, Hung Thuan Nguyen +1
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 degre…
Overlay Network Construction: Improved Overall and Node-Wise Message Complexity
Yi-Jun Chang, Yanyu Chen, Gopinath Mishra
We consider the problem of constructing distributed overlay networks, where nodes in a reconfigurable system can create or sever connections with nodes whose identifiers they know.…