An optimal algorithm for checking regularity: (extended abstract)
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
The regularity lemma and its applications in graph theory
Theoretical aspects of computer science
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
The Regularity Lemma and Its Applications in Graph Theory
Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
On characterizing hypergraph regularity
Random Structures & Algorithms - Special issue: Proceedings of the tenth international conference "Random structures and algorithms"
Integer and fractional packings in dense 3-uniform hypergraphs
Random Structures & Algorithms
Regular pairs in sparse random graphs I
Random Structures & Algorithms
An Algorithmic Version of the Hypergraph Regularity Method
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Short paths in quasi-random triple systems with sparse underlying graphs
Journal of Combinatorial Theory Series B
Efficient Detection of Network Motifs
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Counting stars and other small subgraphs in sublinear time
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Approximate Hypergraph Partitioning and Applications
SIAM Journal on Computing
An Efficient Sparse Regularity Concept
SIAM Journal on Discrete Mathematics
On Computing the Frequencies of Induced Subhypergraphs
SIAM Journal on Discrete Mathematics
A deterministic algorithm for the Frieze-Kannan regularity lemma
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
A faster algorithm for detecting network motifs
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
Maximum dispersion problem in dense graphs
Operations Research Letters
A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma
SIAM Journal on Discrete Mathematics
| Hi-index | 0.00 |
In this paper we give an algorithm which, given a labeled graph on $n$ vertices and a list of all labeled graphs on $k$ vertices, provides for each graph $H$ of this list an approximation to the number of induced copies of $H$ in $G$ with total error small. This algorithm has running time $O(n^{{1 \over \log \log n}} \cdot M(n))$, where $M(n)$ is the time needed to square a $n$ by $n$ matrix with 0, 1-entries over the integers. The main tool in designing this algorithm is a variant of the regularity lemma of Szemeredi.