Native Certification of Some Geometric Intersection Graph Programs
Authors: Benjamín Jauregui, Pedro Montealegre, Diego Ramírez-Romero, Ivan Rapaport
Abstract: Inside the context of distributed certification, the recognition of graph classes has started to be intensively studied. For instance, utterly totally different outcomes related to the recognition of planar, bounded tree-width and H-minor free graphs have been simply recently obtained. The goal of the present work is to design compact certificates for the native recognition of associated geometric intersection graph classes, significantly interval, chordal, spherical arc, trapezoid and permutation. Additional precisely, we give proof labeling schemes recognizing each of these classes with logarithmic-sized certificates. We moreover current tight logarithmic lower bounds on the dimensions of the certificates on the proof labeling schemes for the recognition of any of the aforementioned geometric intersection graph classes.
