On the Benefits of Adaptivity in Property Testing of Dense Graphs

Algorithmica ◽  
2008 ◽  
Vol 58 (4) ◽  
pp. 811-830 ◽  
Author(s):  
Mira Gonen ◽  
Dana Ron
Keyword(s):  
Property Testing ◽  
Dense Graphs

Algorithmic Aspects of Property Testing in the Dense Graphs Model

2011 ◽  
Vol 40 (2) ◽  
pp. 376-445 ◽  
Author(s):  
Oded Goldreich ◽  
Dana Ron
Keyword(s):  
Property Testing ◽  
Dense Graphs

scholarly journals Non-Deterministic Graph Property Testing

2013 ◽  
Vol 22 (5) ◽  
pp. 749-762 ◽  
Author(s):  
LÁSZLÓ LOVÁSZ ◽  
KATALIN VESZTERGOMBI
Keyword(s):  
Property Testing ◽  
Binary Relations ◽  
Finite Graphs ◽  
Graph Limits ◽  
Dense Graphs ◽  
Graph Property

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.

Cycle factors in dense graphs

1999 ◽  
Vol 197-198 (1-3) ◽  
pp. 309-323 ◽  
Author(s):  
E Fischer
Keyword(s):  
Dense Graphs
Sign in / Sign up

Export Citation Format

Share Document