66 search results - page 2 / 14 » Algorithmic Aspects of Property Testing in the Dense Graphs ... |
ICDE
2006
IEEE
14 years 6 months ago
2006
IEEE
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
JSYML
2010
12 years 11 months ago
2010
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
A common thread in all the recent results concerning the testing of dense graphs is the use of Szemer?edi's regularity lemma. In this paper we show that in some sense this is...
ECCC
2006
13 years 4 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...
COCO
2007
Springer
13 years 11 months ago
2007
Springer
We study a model of graph related formulae that we call the Constraint-Graph model. A constraintgraph is a labeled multi-graph (a graph where loops and parallel edges are allowed)...