A note on improved results for one round distributed clique listing

DOI10.1016/j.ipl.2022.106355OpenAlexW4313367657MaRDI QIDQ2681399

Quanquan C. Liu

Publication date: 3 February 2023

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2212.12843

zbMATH Keywords

graph algorithmsdistributed algorithmsdynamic algorithmstriangle countingclique counting

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Sublinear-time distributed algorithms for detecting small cliques and even cycles
• Detecting cliques in CONGEST networks
• Fooling views: a new lower bound technique for distributed computations under congestion
• On the power of the congested clique model
• Deterministic Subgraph Detection in Broadcast CONGEST.
• Lower Bounds for Subgraph Detection in the CONGEST Model
• Front Matter, Table of Contents, Preface, Conference Organization
• Near-optimal Distributed Triangle Enumeration via Expander Decompositions
• Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration
• The Communication Complexity of Set Intersection and Multiple Equality Testing
• Distributed Triangle Detection via Expander Decomposition
• Triangle Finding and Listing in CONGEST Networks
• On Distributed Listing of Cliques

This page was built for publication: A note on improved results for one round distributed clique listing