3 citations · 4 across the 5 of their papers we have counts for
5 papers · 1 filter
How local constraints influence network diameter and applications to LCL generalizations
Nicolas Bousquet, Laurent Feuilloley, Théo Pierron
In this paper, we investigate how local rules enforced at every node can influence the topology of a network. More precisely, we establish several results on the diameter of trees…
Local certification of forbidden subgraphs
Nicolas Bousquet, Linda Cook, Laurent Feuilloley +2
Detecting specific structures in a network has been a very active theme of research in distributed computing for at least a decade. In this paper, we start the study of subgraph de…
What can be certified compactly?
Nicolas Bousquet, Laurent Feuilloley, Théo Pierron
Local certification consists in assigning labels (called \emph{certificates}) to the nodes of a network to certify a property of the network or the correctness of a data structure…
Local certification of MSO properties for bounded treedepth graphs
Nicolas Bousquet, Laurent Feuilloley, Théo Pierron
The graph model checking problem consists in testing whether an input graph satisfies a given logical formula. In this paper, we study this problem in a distributed setting, namely…
Local certification of graph decompositions and applications to minor-free classes
Nicolas Bousquet, Laurent Feuilloley, Théo Pierron
Local certification consists in assigning labels to the nodes of a network to certify that some given property is satisfied, in such a way that the labels can be checked locally. I…