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 …

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 importance of classifying connections in large graphs has been the motivation for a rich
line of work on distributed subgraph finding that has led to exciting recent breakthroughs. A …

Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs Page 1 Fully
Polynomial-Time Distributed Computation in Low-Treewidth Graphs Taisuke Izumi ∗ t-izumi@ist.osaka-u.ac.jp …

Graph spanners have been extensively studied in the literature of graph algorithms. In an
undirected weighted graph G=(V, E, ω) on n vertices, a t-spanner of G is a subgraph that …

We show that, for every $ k\geq 2$, $ C_ {2k} $-freeness can be decided in $ O (n^{1-1/k}) $
rounds in the\CONGEST {} model by a randomized Monte-Carlo distributed algorithm with …

The distributed subgraph detection asks, for a fixed graph $ H $, whether the $ n $-node
input graph contains $ H $ as a subgraph or not. In the standard CONGEST model of …