8 papers
The local complexity of certifying parity
Nicolas Bousquet, Laurent Feuilloley, Jorge Valenzuela +1
In this paper, we consider the problem of locally certifying that the size of a network is even, or more generally, congruent to some fixed number. The parity property is one of th…
Renaming in distributed certification
Nicolas Bousquet, Louis Esperet, Laurent Feuilloley +1
Local certification is the area of distributed network computing asking the following question: How to certify to the nodes of a network that a global property holds, if they are l…
Shallow brambles
Nicolas Bousquet, Wouter Cames van Batenburg, Louis Esperet +2
A graph class has polynomial expansion if there is a polynomial function such that for every graph , each of the depth- minors of has ave…
Complexity landscape for local certification
Nicolas Bousquet, Laurent Feuilloley, Sébastien Zeitoun
An impressive recent line of work has charted the complexity landscape of distributed graph algorithms. For many settings, it has been determined which time complexities exist, and…
A subquadratic certification scheme for P5-free graphs
Nicolas Bousquet, Sébastien Zeitoun
In local certification, vertices of a -vertex graph perform a local verification to check if a given property is satisfied by the graph. This verification is performed thanks to…
A note on locating-dominating sets in twin-free graphs
Nicolas Bousquet, Quentin Chuet, Victor Falgas-Ravry +2
In this short note, we prove that every twin-free graph on vertices contains a locating-dominating set of size at most . This improves the earlier bou…