Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization

Yi-Jun Chang
Yi-Jun Chang

FOCS, pp. 377-388, 2020.

Cited by: 0|Bibtex|Views7|DOI:https://doi.org/10.1109/FOCS46700.2020.00043
EI
Other Links: arxiv.org|dblp.uni-trier.de

Abstract:

There is a recent exciting line of work in distributed graph algorithms in the $\mathsf{CONGEST}$ model that exploit expanders. All these algorithms so far are based on two tools: expander decomposition and expander routing. An $(\epsilon,\phi)$-expander decomposition removes $\epsilon$-fraction of the edges so that the remaining connec...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments