A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
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. The goal is to assign 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. We first investigate which properties can be locally certified with small certificates. Not surprisingly, this is almost never the case,arXiv:2110.01936v1 fatcat:344p5alkczaxfgn7xnmm63ah2q