We introduce a notion for hierarchical graph clustering which we call the expander hierarchy
and show a fully dynamic algorithm for maintaining such a hierarchy on a graph with n …

There is a recent exciting line of work in distributed graph algorithms in the CONGEST
model that exploit expanders. All these algorithms so far are based on two tools: expander …

We present improved distributed algorithms for variants of the triangle finding problem in the
model. We show that triangle detection, counting, and enumeration can be solved in rounds …

The possibilities offered by quantum computing have drawn attention in the distributed
computing community recently, with several breakthrough results showing quantum …

A proof-labeling scheme (PLS) for a boolean predicate $\Pi $ on labeled graphs is a
mechanism used for certifying the legality with respect to $\Pi $ of global network states in a …

This is a survey of the exciting recent progress made in understanding the complexity of
distributed subgraph finding problems. It overviews the results and techniques for assorted …

The Quantum CONGEST model is a variant of the CONGEST model, where messages
consist of O (log (n)) qubits. In this paper, we give a general framework for implementing …

The problem of detecting network structures plays a central role in distributed computing.
One of the fundamental problems studied in this area is to determine whether for a given …

In this paper we give fast distributed graph algorithms for detecting and listing small
subgraphs, and for computing or approximating the girth. Our algorithms improve upon the …

We show an Õ (np/(p+ 2))-round algorithm in the CONGEST model for listing of Kp (a clique
with p nodes), for all p= 4, p≥ 6. For p= 5, we show an Õ (n 3/4)-round algorithm. For p= 4 …