Local Certification of Graphs with Bounded Genus

07/16/2020
by   Laurent Feuilloley, et al.
0

Naor, Parter, and Yogev [SODA 2020] recently designed a compiler for automatically translating standard centralized interactive protocols to distributed interactive protocols, as introduced by Kol, Oshman, and Saxena [PODC 2018]. In particular, by using this compiler, every linear-time algorithm for deciding the membership to some fixed graph class can be translated into a 𝖽𝖬𝖠𝖬(O(log n)) protocol for this class, that is, a distributed interactive protocol with O(log n)-bit proof size in n-node graphs, and three interactions between the (centralizer) computationally-unbounded but non-trustable prover Merlin, and the (decentralized) randomized computationally-limited verifier Arthur. As a corollary, there is a 𝖽𝖬𝖠𝖬(O(log n)) protocol for the class of planar graphs, as well as for the class of graphs with bounded genus. We show that there exists a distributed interactive protocol for the class of graphs with bounded genus performing just a single interaction, from the prover to the verifier, yet preserving proof size of O(log n) bits. This result also holds for the class of graphs with bounded demi-genus, that is, graphs that can be embedded on a non-orientable surface of 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 [PODC 2005]. In particular, these schemes do not require any randomization from the verifier, and the proofs may often be computed a priori, at low cost, by the nodes themselves. Our results thus extend the recent proof-labeling scheme for planar graphs by Feuilloley et al. [PODC 2020], to graphs of bounded genus, and to graphs of bounded demigenus.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/12/2020

Compact Distributed Certification of Planar Graphs

Naor, Parter, and Yogev (SODA 2020) have recently demonstrated the exist...
research
05/24/2022

A Mechanized Proof of Bounded Convergence Time for the Distributed Perimeter Surveillance System (DPSS) Algorithm A

The decentralized perimeter surveillance system (DPSS) seeks to provide ...
research
12/06/2021

Distributed Interactive Proofs for the Recognition of Some Geometric Intersection Graph Classes

A graph G=(V,E) is a geometric intersection graph if every node v ∈ V is...
research
12/06/2020

Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs

We present compact distributed interactive proofs for the recognition of...
research
05/12/2023

Distributed derandomization revisited

One of the cornerstones of the distributed complexity theory is the dera...
research
12/06/2021

A Meta-Theorem for Distributed Certification

Distributed certification, whether it be proof-labeling schemes, locally...
research
10/04/2022

Distributed Quantum Interactive Proofs

The study of distributed interactive proofs was initiated by Kol, Oshman...

Please sign up or login with your details

Forgot password? Click here to reset