Join Our Newsletter

APPROX

2011

Springer

8 years 10 months ago
2011

Springer

In a well-known result Goldreich and Trevisan (2003) showed that every testable graph property has a “canonical” tester in which a set of vertices is selected at random and the...

PODC

2011

ACM

9 years 1 months ago
2011

ACM

This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be veriﬁed with a distri...

RSA

2008

9 years 10 months ago
2008

For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...

EJC

2007

9 years 10 months ago
2007

We construct algorithms for deciding essentially any minor-closed parameter, with explicit time bounds. This result strengthens previous results by Robertson and Seymour [1,2], Fr...

ECCC

2007

9 years 10 months ago
2007

We study graph properties which are testable for bounded degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined grap...

COMBINATORICA

2006

9 years 10 months ago
2006

We introduce and discuss generalizations of the problem of independent transversals. Given a graph property R, we investigate whether any graph of maximum degree at most d with a ...

ECCC

2008

9 years 10 months ago
2008

Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...

ICALP

2001

Springer

10 years 3 months ago
2001

Springer

We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...

STOC

2006

ACM

10 years 11 months ago
2006

ACM

A common thread in all the recent results concerning the testing of dense graphs is the use of Szemer?edi's regularity lemma. In this paper we show that in some sense this is...