Deterministic near-optimal distributed listing of cliques

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Distributed discovery of large near-cliques
Selection and sorting with limited storage
The space complexity of approximating the frequency moments
Distributed testing of excluded subgraphs
Algebraic methods in the congested clique
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
Sparse matrix multiplication and triangle listing in the congested clique model
Large cuts with local algorithms on triangle-free graphs
On the power of the congested clique model
Approximating the Permanent
Deterministic Subgraph Detection in Broadcast CONGEST.
Lower Bounds for Subgraph Detection in the CONGEST Model
Data Streams: Algorithms and Applications
“Tri, Tri Again”: Finding Triangles and Small Subgraphs in a Distributed Setting
Near-optimal Distributed Triangle Enumeration via Expander Decompositions
Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration
Distributed Triangle Detection via Expander Decomposition
Fast Distributed Coloring Algorithms for Triangle-Free Graphs
Distributed MST and Routing in Almost Mixing Time
Triangle Finding and Listing in CONGEST Networks
On Distributed Listing of Cliques
The Communication Complexity of Set Intersection and Multiple Equality Testing
Fast distributed algorithms for testing graph properties
Three notes on distributed property testing
Fast distributed algorithms for girth, cycles and small subgraphs

This page was built for publication: Deterministic near-optimal distributed listing of cliques