Brief Announcement: Global certification via perfect hashing
Nicolás Bousquet, Laurent Feuilloley, Sébastien Zeitoun · 2024
In this work, we provide an upper bound for global certification of graph homomorphism, a generalization of graph coloring. In certification, the nodes of a network should decide if the network satisfies a given property, thanks to small pieces of information called certificates. Here, there is only one global certificate which is shared by all the nodes, and the property we want to certify is the existence of a graph homomorphism to a given graph.