Planarity can be Verified by an Approximate Proof Labeling Scheme in Constant-Time

Elek, Gabor (2022) Planarity can be Verified by an Approximate Proof Labeling Scheme in Constant-Time. Journal of Combinatorial Theory, Series A, 191: 105643. ISSN 0097-3165

Text (legujlocal)
legujlocal.pdf - Accepted Version
Available under License Creative Commons Attribution-NonCommercial-NoDerivs.
Download (402kB)

Abstract

Approximate proof labeling schemes were introduced by Censor-Hillel, Paz and Perry. Roughly speaking, a graph property P can be verified by an approximate proof labeling scheme in constant-time if the vertices of a graph having the property can be convinced, in a short period of time not depending on the size of the graph, that they are having the property P or at least they are not far from being having the property P. The main result of this paper is that bounded-degree planar graphs (and also outer-planar graphs, bounded genus graphs, knotlessly embeddable graphs etc.) can be verified by an approximate proof labeling scheme in constant-time.

Item Type:

Journal Article

Journal or Publication Title:

Journal of Combinatorial Theory, Series A

Uncontrolled Keywords:

/dk/atira/pure/subjectarea/asjc/2600/2607

Subjects:

?? approximate proof labeling schemesplanar graphsproperty ahyperfinitenessdiscrete mathematics and combinatoricscomputational theory and mathematicstheoretical computer science ??

Departments:

Faculty of Science and Technology > Mathematics and Statistics

ID Code:

211952

Deposited By:

ep_importer_pure

Deposited On:

21 Dec 2023 16:25

Refereed?:

Yes

Published?:

Published

Last Modified:

23 Oct 2024 00:05

URI:

https://eprints.lancs.ac.uk/id/eprint/211952