1127 search results - page 21 / 226 » Testing the Expansion of a Graph |
ESA
2010
Springer
14 years 1 days ago
2010
Springer
In this paper we develop a property testing algorithm for the problem of testing whether a directed geometric graph with bounded (out)degree is a (1 + )-spanner.
JCO
2007
13 years 10 months ago
2007
This paper discusses the relation among four problems: graph testing, DNA complex screening, superimposed codes and secure key distribution. We prove a surprising equivalence relat...
FOCS
2009
IEEE
14 years 5 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
PVLDB
2008
13 years 10 months ago
2008
Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query...
PAMI
2007
13 years 10 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...