Local certification of forbidden subgraphs - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2024

Local certification of forbidden subgraphs

Résumé

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 detection from the perspective of local certification. Remember that a local certification is a distributed mechanism enabling the nodes of a network to check the correctness of the current configuration, thanks to small pieces of information called certificates. Our main question is: For a given graph $H$, what is the minimum certificate size that allows checking that the network does not contain $H$ as a (possibly induced) subgraph? We show a variety of lower and upper bounds, uncovering an interesting interplay between the optimal certificate size, the size of the forbidden subgraph, and the locality of the verification. Along the way we introduce several new technical tools, in particular what we call the \emph{layered map}, which is not specific to forbidden subgraphs and that we expect to be useful for certifying many other properties.
Fichier principal
Vignette du fichier
2402.12148.pdf (859.51 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04467821 , version 1 (20-02-2024)

Identifiants

Citer

Nicolas Bousquet, Linda Cook, Laurent Feuilloley, Théo Pierron, Sébastien Zeitoun. Local certification of forbidden subgraphs. 2024. ⟨hal-04467821⟩
4 Consultations
1 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More