Showing 2026 · cs.DCShow all
2 papers · 2 filters
cs.DC2026
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…
cs.DC2026
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…