Work

Brief Announcement: New Distributed Interactive Proofs for Planarity: A Matter of Left and Right

Year: 2025

Type: conference-paper

Abstract: We provide new distributed interactive proofs (DIP) for planarity and related graph families. The notion of a distributed interactive proof (DIP) was introduced by Kol, Oshman, and Saxena (PODC 2018). In this setting, the verifier consists of n nodes connected by a communication graph G. The prover is a single entity that communicates with all nodes by short messages. The goal is to verify that the graph G satisfies a certain property (e.g., planarity) in a small number of rounds, and with a small communication bound, denoted as the proof size.

Source: ACM Symposium on Principles of Distributed Computing (PODC)

DOI: 10.1145/3732772.3733535

Authors: Yuval Gil, Merav Parter

Institution: Weizmann Institute of Science

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Funders: European Commission, H2020 European Research Council

Awards: G434337789, A Graph Theoretic Approach for Resilient Distributed Algorithms