Local certification of graphs with bounded genus

نویسندگان

چکیده

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

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the orientable genus of graphs with bounded nonorientable genus

A conjecture of Robertson and Thomas on the orientable genus of graphs with a given nonorientable embedding is disproved.

متن کامل

Deleting vertices to graphs of bounded genus

We show that a problem of deleting a minimum number of vertices from a graph to obtain a graph embeddable on a surface of a given Euler genus is solvable in time 2Cg·k 2 log knO(1), where k is the size of the deletion set, Cg is a constant depending on the Euler genus g of the target surface, and n is the size of the input graph. On the way to this result, we develop an algorithm solving the pr...

متن کامل

The Bidimensional Theory of Bounded-Genus Graphs

Bidimensionality is a powerful tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor. This paper completes the theory of bidimensionality for graphs of bounded genus (which is a minorexcluding family). Specifically we show that, for any problem whose solution value does not increase under contractions and who...

متن کامل

Edge separators for graphs of bounded genus with applications

Many divide-and-conquer algorithms on graphs are based on finding a small set of vertices or edges whose removal divides the graph roughly in half. Applications include VLSI layouts [14], Gaussian elimination Cl.51 and graph embeddings [17]. Formally, a class of graphs hasf’(n) vertex (edge) separator if every n-vertex graph in the class has a vertex (edge) cutset of sizef(n) that divides the g...

متن کامل

Edge Separators for Graphs of Bounded Genus with Applications

We prove that every n-vertex graph of genus 9 and maximal degree k has an edge separator of size O( ..;gTffl). The upper bound is best possible to within a constant factor. This extends known results on planar graphs and similar results about vertex separators. We apply the edge separatorto the isoperimetric number problem, graph embeddings and lower bounds for crossing numbers.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2023

ISSN: ['1872-6771', '0166-218X']

DOI: https://doi.org/10.1016/j.dam.2022.10.004