Distributed processing of large-scale graph data has many practical applications and has
been widely studied. In recent years, a lot of distributed graph processing frameworks and …

Local certification consists in assigning labels to the vertices of a network to certify that some
given property is satisfied, in such a way that the labels can be checked locally. In the last …

In the distributed subgraph detection problem, we are given a fixed subgraph H, and the
network must decide whether the network graph contains a copy of H or not. Subgraph …

We present a new technique to efficiently sample and communicate a large number of
elements from a distributed sampling space. When used in the context of a recent Local …

We survey the recent distributed computing literature on checking whether a given
distributed system configuration satisfies a given boolean predicate, ie, whether the …

In this paper we give sublinear-time distributed algorithms in the CONGEST CONGEST
model for finding or listing cliques and even-length cycles. We show for the first time that all …

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 …

In this paper we present distributed property-testing algorithms for graph properties in the
CONGEST model, with emphasis on testing subgraph-freeness. Testing a graph property P …

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 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 …