Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019.
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
PPT (Upload PPT)