• Corpus ID: 238354361

Local certification of MSO properties for bounded treedepth graphs

  title={Local certification of MSO properties for bounded treedepth graphs},
  author={Nicolas Bousquet and Laurent Feuilloley and Th{\'e}o Pierron},
The graph model checking problem consists in testing whether an input graph satis es a given logical formula. In this paper, we study this problem in a distributed setting, namely local certi cation. The goal is to assign labels to the nodes of a network to certify that some given property is satis ed, in such a way that the labels can be checked locally. We rst investigate which properties can be locally certi ed with small certi cates. Not surprisingly, this is almost never the case, except… 

Figures from this paper

What can be certified compactly?
The first meta-theorems for local certification is proved, using MSO, the most classic fragment for logics on graphs, to prove that in bounded treedepth graphs, every MSO property has a compact certification.
Testability and local certification of monotone properties in minor-closed classes
The main problem in the area of property testing is to understand which graph properties are testable, which means that with constantly many queries to any input graph G, a tester can decide with
A Meta-Theorem for Distributed Certification
It is proved that, for every boolean predicate on graphs definable in the monadic second-order (MSO) logic of graphs, there exists a distributed certification mechanism using certificates on O(log n) bits in n-node graphs of bounded treewidth, with a verification protocol involving a single round of communication between neighbors.


Theoretical Computer Science Local certification of graphs on surfaces ✩
  • Mathematics, Computer Science
The main idea is to encode a rotation system locally, together with a spanning tree supporting the local computation of the genus through Euler’s formula via Euler's formula, and gives a very short proof for any surface.
Local certification of graph decompositions and applications to minor-free classes
New decomposition tools for graph certification are developed and applied and it is shown that for every small enough minor H, H -minor-free graphs can indeed be certified with labels of size O (log n ).
Near-optimal Distributed Triangle Enumeration via Expander Decompositions
The triangle detection, counting, and enumeration can be solved in an improved distributed algorithm by Izumi and Le Gall and Pandurangan, Robinson, and Scquizzato.
Local Certification of Graphs with Bounded Genus
The interactive protocols described in this paper are actually proof-labeling schemes, i.e., a subclass of interactive protocols, previously introduced by Korman, Kutten, and Peleg, and the proofs may often be computed a priori, at low cost, by the nodes themselves.
Algorithmic Meta Theorems
An overview of algorithmic meta theorems and the main techniques used in their proofs is given and a comprehensive survey of the material is provided.
Graph minors. I. Excluding a forest
Redundancy in distributed proofs
It is shown that many network predicates have distributed proofs offering a high level of redundancy, explicitly or implicitly, and this remarkable property of distributed proofs is used to establish perfect tradeoffs between the size of the certificate stored at every node, and the number of rounds of the verification protocol.
On the Ehrenfeucht-Fraïssé Game in Theoretical Computer Science
An introduction to (first-order) Ehrenfeucht-Fraisse games is presented, and three applications in theoretical computer science are discussed. These are concerned with the expressive power of
Local Decision and Verification with Bounded-Size Outputs
This paper provides separation results between distributed decision and verification classes, and the size of the certificates enabling to verify distributed languages is analyzed.
Approximate Proof-Labeling Schemes
A new model of verification of boolean predicates over distributed networks that defines a distributed proof in the form of a label that is given to each node and all nodes locally verify that the network configuration satisfies the desired boolean predicate by exchanging labels with their neighbors.