2 papers
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
Introvert Clustering for Distributed Graph Algorithms
Yi-Jun Chang, Nima Dolatabadi
We introduce a graph decomposition primitive called introvert clustering, which strengthens standard low-diameter clustering by guaranteeing that every clustered vertex keeps at le…