A note on improved results for one round distributed clique listing
type: Item
instance of: scholarly article
title: A note on improved results for one round distributed clique listing
author: Quanquan C. Liu
published in: Information Processing Letters
publication date: 2023-02-03T00:00:00Z
full work available at URL: https://arxiv.org/abs/2212.12843
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7649511
zbMATH Keywords: triangle counting
zbMATH Keywords: clique counting
zbMATH Keywords: distributed algorithms
zbMATH Keywords: graph algorithms
zbMATH Keywords: dynamic algorithms
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W4313367657
cites work: Front Matter, Table of Contents, Preface, Conference Organization
cites work: Fooling views: a new lower bound technique for distributed computations under congestion
cites work: Distributed detection of cliques in dynamic networks
cites work: On Distributed Listing of Cliques
cites work: Detecting cliques in CONGEST networks
cites work: Near-optimal Distributed Triangle Enumeration via Expander Decompositions
cites work: Distributed triangle detection via expander decomposition
cites work: Improved distributed expander decomposition and nearly optimal triangle enumeration
cites work: On the power of the congested clique model
cites work: Sublinear-time distributed algorithms for detecting small cliques and even cycles
cites work: Lower bounds for subgraph detection in the CONGEST model
cites work: The communication complexity of set intersection and multiple equality testing
cites work: Triangle Finding and Listing in CONGEST Networks
cites work: Deterministic subgraph detection in broadcast CONGEST
cites work: The distributed minimum spanning tree problem
DOI: 10.1016/J.IPL.2022.106355
Recommended article: On Distributed Listing of Cliques
Recommended article: Distributed algorithms for maximum cliques
Recommended article: Near-constant-time distributed algorithms on a congested clique
Recommended article: Sublinear-time distributed algorithms for detecting small cliques and even cycles
Recommended article: Distributed discovery of large near-cliques
Recommended article: Distributed Discovery of Large Near-Cliques
Recommended article: Clique here: on the distributed complexity in fully-connected networks
Recommended article: ON TWO APPROXIMATION ALGORITHMS FOR THE CLIQUE PROBLEM
description: scientific article; zbMATH DE number 7649511