6 search results - page 1 / 2 » A Characterization of the (natural) Graph Properties Testabl... |
FOCS
2005
IEEE
13 years 10 months ago
2005
IEEE
The problem of characterizing all the testable graph properties is considered by many to be the most important open problem in the area of property-testing. Our main result in thi...
SODA
2004
ACM
13 years 5 months ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
STOC
2005
ACM
14 years 4 months ago
2005
ACM
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
ECCC
2010
13 years 4 months ago
2010
Abstract--There has been a sequence of recent papers devoted to understanding the relation between the testability of properties of Boolean functions and the invariance of the prop...
STOC
2003
ACM
14 years 4 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...