Distributed Degree Splitting, Edge Coloring, and Orientations


We study a family of closely-related distributed graph problems, which we call degree splitting, where roughly speaking the objective is to partition (or orient) the edges such that each node’s degree is split almost uniformly. Our findings lead to answers for a number of problems, a sampling of which includes: • We present a poly log n round deterministic… (More)


2 Figures and Tables


Citations per Year

Citation Velocity: 11

Averaging 11 citations per year over the last 2 years.

Learn more about how we calculate this metric in our FAQ.

Cite this paper

@inproceedings{Ghaffari2017DistributedDS, title={Distributed Degree Splitting, Edge Coloring, and Orientations}, author={Mohsen Ghaffari and Hsin-Hao Su}, booktitle={SODA}, year={2017} }