1127 search results - page 26 / 226 » Testing the Expansion of a Graph |
DCC
2008
IEEE
14 years 5 months ago
2008
IEEE
In this paper we introduce an adaptive technique for compressing small quantities of text which are organized as a rooted directed graph. We impose a constraint on the technique s...
COMBINATORICS
2004
13 years 10 months ago
2004
Until now, the enumeration of connected graphs has been dealt with by probabilistic methods, by special combinatorial decompositions or by somewhat indirect formal series manipula...
ECCC
2006
13 years 11 months ago
2006
We show that in the bounded degree model for graph property testing, adaptivity is essential. An algorithm is non-adaptive if it makes all queries to the input before receiving an...
RSA
2002
13 years 10 months ago
2002
Let H be a fixed graph with h vertices, let G be a graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. It is known that in this ca...
ERLANG
2004
ACM
14 years 4 months ago
2004
ACM
Testing of software components during development is a heavily used approach to detect programming errors and to evaluate the quality of software. Systematic approaches to softwar...