Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration

Yi-Jun Chang
Yi-Jun Chang

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019.

Cited by: 11|Bibtex|Views9|DOI:https://doi.org/10.1145/3293611.3331618
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|dl.acm.org|arxiv.org

Abstract:

An(ε,φ)-expander decomposition of a graph G=(V,E) is a clustering of the vertices V=V1∪…∪ Vx such that (1) each cluster Vi induces subgraph with conductance at least φ, and (2) the number of inter-cluster edges is at most ε|E|. In this paper, we give an improved distributed expander decomposition, and obtain a nearly optimal distributed t...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments