dc.contributor.author | Lovász, László Miklós | |
dc.contributor.author | Zhao, Yufei | |
dc.date.accessioned | 2020-07-14T15:18:41Z | |
dc.date.available | 2020-07-14T15:18:41Z | |
dc.date.issued | 2019-09 | |
dc.identifier.issn | 0963-5483 | |
dc.identifier.uri | https://hdl.handle.net/1721.1/126175 | |
dc.description.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 | en_US |
dc.description.sponsorship | National Science Foundation (U.S.). Postdoctoral Fellowship (Award DMS 1705204) | en_US |
dc.description.sponsorship | National Science Foundation (U.S.) (Award DMS 1362326) | en_US |
dc.language.iso | en | |
dc.publisher | Cambridge University Press (CUP) | en_US |
dc.relation.isversionof | 10.1017/S0963548319000075 | en_US |
dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | en_US |
dc.source | arXiv | en_US |
dc.title | A fast new algorithm for weak graph regularity | en_US |
dc.type | Article | en_US |
dc.identifier.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) | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Mathematics | en_US |
dc.relation.journal | Combinatorics, probability & computing | en_US |
dc.eprint.version | Original manuscript | en_US |
dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
eprint.status | http://purl.org/eprint/status/NonPeerReviewed | en_US |
dc.date.updated | 2019-11-24T15:57:49Z | |
dspace.date.submission | 2019-11-24T15:57:51Z | |
mit.journal.volume | 28 | en_US |
mit.journal.issue | 5 | en_US |
mit.metadata.status | Complete | |