Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration
From MaRDI portal
Publication:5145182
DOI10.1145/3293611.3331618zbMath1464.68439arXiv1904.08037OpenAlexW2963612177MaRDI QIDQ5145182
Thatchaphol Saranurak, Yi-Jun Chang
Publication date: 20 January 2021
Published in: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.08037
Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Distributed algorithms (68W15)
Related Items (7)
Sublinear-time distributed algorithms for detecting small cliques and even cycles ⋮ A note on improved results for one round distributed clique listing ⋮ The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs ⋮ Detecting cliques in CONGEST networks ⋮ Fooling views: a new lower bound technique for distributed computations under congestion ⋮ The Communication Complexity of Set Intersection and Multiple Equality Testing ⋮ Distributed detection of clusters of arbitrary size
This page was built for publication: Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration