Near-optimal Distributed Triangle Enumeration via Expander Decompositions

DOI10.1145/3446330zbMath1499.68260OpenAlexW3160071378WikidataQ130856886 ScholiaQ130856886MaRDI QIDQ5056410

Yi-Jun Chang, Hengjie Zhang, Thatchaphol Saranurak, Seth Pettie

Publication date: 8 December 2022

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3446330

zbMATH Keywords

distributed graph algorithmsCONGEST

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (3)

A note on improved results for one round distributed clique listing ⋮ Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications ⋮ Deterministic near-optimal distributed listing of cliques

This page was built for publication: Near-optimal Distributed Triangle Enumeration via Expander Decompositions