## A fast new algorithm for weak graph regularity

##### Author(s)

Lovász, László Miklós; Zhao, Yufei
DownloadSubmitted version (197.4Kb)

##### Terms of use

##### Metadata

Show full item record##### Abstract

We provide a deterministic algorithm that finds, in ϵ-O(1) n 2 time, an ϵ-regular Frieze-Kannan partition of a graph on n vertices. The algorithm outputs an approximation of a given graph as a weighted sum of ϵ-O(1) many complete bipartite graphs. As a corollary, we give a deterministic algorithm for estimating the number of copies of H in an n-vertex graph G up to an additive error of at most ϵn v(H), in time ϵ-O H(1) n 2

##### Date issued

2019-09##### Department

Massachusetts Institute of Technology. Department of Mathematics##### Journal

Combinatorics, probability & computing

##### Publisher

Cambridge University Press (CUP)

##### Citation

Fox, Jacob, László Miklós Lovász and Yufei Zhao. “A fast new algorithm for weak graph regularity.” Combinatorics, probability & computing, vol. 28, no. 5, 2019, pp. 777-790 © 2019 The Author(s)

Version: Original manuscript

##### ISSN

0963-5483