# Graph property

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

- Combinatorics, Probability & Computing
- 2013

A property of finite graphs is called nondeterministically testable if it has a " certificate " such that once the certificate isâ€¦Â (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- STOC
- 2006

A common thread in recent results concerning the testing of dense graphs is the use of SzemerÃ©di's regularity lemma. In thisâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- STOC
- 2005

A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it isâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- 46th Annual IEEE Symposium on Foundations ofâ€¦
- 2005

The problem of characterizing all the testable graph properties is considered by many to be the most important open problem inâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- Random Struct. Algorithms
- 2001

Property testing is a relaxation of decision problems in which it is required to distinguish YES-instances (i.e., objects havingâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- CP
- 2000

This report introduces a classification scheme for the global constraints. This classification is based on four basic ingredientsâ€¦Â (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- 1998

Consider G(n, p) to be the probability space of random graphs on n vertices with edge probability p. We will be consideringâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- Algorithmica
- 1997

We further develop the study of testing graph properties as initiated by Goldreich, Goldwasser and Ron. Loosely speaking, givenâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- 1996

In their seminal work which initiated random graph theory Erd os and R enyi discovered that many graph properties have sharpâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Theor. Comput. Sci.
- 1996

Graphs are finite and handled as relational structures. We give some answers to the following general questions: (1) For whichâ€¦Â (More)

Is this relevant?