71 search results - page 12 / 15 » Lower Bounds for Testing Bipartiteness in Dense Graphs |
SWAT
2004
Springer
15 years 2 months ago
2004
Springer
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
SIAMCOMP
2000
14 years 9 months ago
2000
This paper describes a scheme to implement a shared address space of size m on an n-node mesh, with m polynomial in n, where each mesh node hosts a processor and a memory module. A...
STACS
2007
Springer
15 years 3 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
DAGSTUHL
2004
14 years 10 months ago
2004
A well-studied problem in fault diagnosis is to identify the set of all good processors in a given set {p1, p2, . . . , pn} of processors via asking some processors pi to test whet...