Non-deterministic graph property testing

L. Lovász, Katalin Vesztergombi

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

A property of finite graphs is called non-deterministically testable if it has a 'certificate' such that once the certificate is specified, its correctness can be verified by random local testing. In this paper we study certificates that consist of one or more unary and/or binary relations on the nodes, in the case of dense graphs. Using the theory of graph limits, we prove that non-deterministically testable properties are also deterministically testable.

Original languageEnglish
Pages (from-to)749-762
Number of pages14
JournalCombinatorics Probability and Computing
Volume22
Issue number5
DOIs
Publication statusPublished - Sep 2013

Fingerprint

Property Testing
Certificate
Testing
Graph in graph theory
Binary relation
Unary
Finite Graph
Correctness
Vertex of a graph

ASJC Scopus subject areas

  • Applied Mathematics
  • Theoretical Computer Science
  • Computational Theory and Mathematics
  • Statistics and Probability

Cite this

Non-deterministic graph property testing. / Lovász, L.; Vesztergombi, Katalin.

In: Combinatorics Probability and Computing, Vol. 22, No. 5, 09.2013, p. 749-762.

Research output: Contribution to journalArticle

Lovász, L. ; Vesztergombi, Katalin. / Non-deterministic graph property testing. In: Combinatorics Probability and Computing. 2013 ; Vol. 22, No. 5. pp. 749-762.
@article{9d9f4a0519c84e43aaee6052e00a9a7a,
title = "Non-deterministic graph property testing",
abstract = "A property of finite graphs is called non-deterministically testable if it has a 'certificate' such that once the certificate is specified, its correctness can be verified by random local testing. In this paper we study certificates that consist of one or more unary and/or binary relations on the nodes, in the case of dense graphs. Using the theory of graph limits, we prove that non-deterministically testable properties are also deterministically testable.",
author = "L. Lov{\'a}sz and Katalin Vesztergombi",
year = "2013",
month = "9",
doi = "10.1017/S0963548313000205",
language = "English",
volume = "22",
pages = "749--762",
journal = "Combinatorics Probability and Computing",
issn = "0963-5483",
publisher = "Cambridge University Press",
number = "5",

}

TY - JOUR

T1 - Non-deterministic graph property testing

AU - Lovász, L.

AU - Vesztergombi, Katalin

PY - 2013/9

Y1 - 2013/9

N2 - A property of finite graphs is called non-deterministically testable if it has a 'certificate' such that once the certificate is specified, its correctness can be verified by random local testing. In this paper we study certificates that consist of one or more unary and/or binary relations on the nodes, in the case of dense graphs. Using the theory of graph limits, we prove that non-deterministically testable properties are also deterministically testable.

AB - A property of finite graphs is called non-deterministically testable if it has a 'certificate' such that once the certificate is specified, its correctness can be verified by random local testing. In this paper we study certificates that consist of one or more unary and/or binary relations on the nodes, in the case of dense graphs. Using the theory of graph limits, we prove that non-deterministically testable properties are also deterministically testable.

UR - http://www.scopus.com/inward/record.url?scp=84881457015&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84881457015&partnerID=8YFLogxK

U2 - 10.1017/S0963548313000205

DO - 10.1017/S0963548313000205

M3 - Article

AN - SCOPUS:84881457015

VL - 22

SP - 749

EP - 762

JO - Combinatorics Probability and Computing

JF - Combinatorics Probability and Computing

SN - 0963-5483

IS - 5

ER -