2531 search results - page 36 / 507 » Group testing in graphs |
APPROX
2009
Springer
14 years 5 months ago
2009
Springer
In this paper we consider two basic questions regarding the query complexity of testing graph properties in the adjacency matrix model. The first question refers to the relation ...
GG
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Code generators are widely used in the development of embedded software to automatically generate executable code from graphical specifications. However, at present, cod...
FOCS
2002
IEEE
14 years 3 months ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
CP
2009
Springer
14 years 11 months ago
2009
Springer
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...
STOC
2003
ACM
14 years 10 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...