37 search results - page 1 / 8 » What is the furthest graph from a hereditary property |
RSA
2008
13 years 4 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...
ECCC
2007
13 years 4 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...
JCT
2008
13 years 4 months ago
2008
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...
PST
2008
13 years 6 months ago
2008
This paper presents a new personal data access control (PDAC) scheme that is inspired by the protection schemes practiced in communities for sharing valuable commodities. The PDAC...