Compact Distributed Certification of Planar Graphs - GATE - Théorie des jeux, choix collectifs et marchés Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

Compact Distributed Certification of Planar Graphs

Résumé

Naor, Parter, and Yogev (SODA 2020) have recently demonstrated the existence of a distributed interactive proof for planarity (i.e., for certifying that a network is planar), using a sophisticated generic technique for constructing distributed IP protocols based on sequential IP protocols. The interactive proof for planarity is based on a distributed certification of the correct execution of any given sequential linear-time algorithm for planarity testing. It involves three interactions between the prover and the randomized distributed verifier (i.e., it is a dMAM protocol), and uses small certificates, on O(log n) bits in n-node networks. We show that a single interaction from the prover suffices, and randomization is unecessary, by providing an explicit description of a proof-labeling scheme for planarity, still using certificates on just O(log n) bits. We also show that there are no proof-labeling schemes-in fact, even no locally checkable proofs-for planarity using certificates on o(log n) bits.
Fichier principal
Vignette du fichier
Compact Distributed Certification of Planar Graphs.pdf (327.24 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

halshs-02991868 , version 1 (06-11-2020)

Identifiants

Citer

Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, et al.. Compact Distributed Certification of Planar Graphs. 39th ACM Symposium on Principles of Distributed Computing, Aug 2020, Virtual Event Italy, Italy. pp.319-328, ⟨10.1145/3382734.3404505⟩. ⟨halshs-02991868⟩
94 Consultations
56 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More