{"id":"https://openalex.org/W2783015638","doi":"https://doi.org/10.1017/s0963548319000075","title":"A fast new algorithm for weak graph regularity","display_name":"A fast new algorithm for weak graph regularity","publication_year":2019,"publication_date":"2019-05-03","ids":{"openalex":"https://openalex.org/W2783015638","doi":"https://doi.org/10.1017/s0963548319000075","mag":"2783015638"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548319000075","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548319000075","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/E17D06308910088718F987EB1C8A6560/S0963548319000075a.pdf/div-class-title-a-fast-new-algorithm-for-weak-graph-regularity-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/E17D06308910088718F987EB1C8A6560/S0963548319000075a.pdf/div-class-title-a-fast-new-algorithm-for-weak-graph-regularity-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Jacob Fox","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jacob Fox","raw_affiliation_strings":["Department of Mathematics, Stanford University, Stanford, CA 94305, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Stanford University, Stanford, CA 94305, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":null,"display_name":"L\u00e1szl\u00f3 Mikl\u00f3s Lov\u00e1sz","orcid":null},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"L\u00e1szl\u00f3 Mikl\u00f3s Lov\u00e1sz","raw_affiliation_strings":["Department of Mathematics, MIT, Cambridge, MA 02139, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, MIT, Cambridge, MA 02139, USA","institution_ids":["https://openalex.org/I4210110987"]}]},{"author_position":"last","author":{"id":null,"display_name":"Yufei Zhao","orcid":null},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yufei Zhao","raw_affiliation_strings":["Department of Mathematics, MIT, Cambridge, MA 02139, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, MIT, Cambridge, MA 02139, USA","institution_ids":["https://openalex.org/I4210110987"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210110987"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.0386458,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"28","issue":"5","first_page":"777","last_page":"790"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9023000001907349,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9023000001907349,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.015699999406933784,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.014999999664723873,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5845999717712402},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5008000135421753},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.41449999809265137},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.38260000944137573},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.34689998626708984},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.33880001306533813},{"id":"https://openalex.org/keywords/null-graph","display_name":"Null graph","score":0.32760000228881836},{"id":"https://openalex.org/keywords/graph-bandwidth","display_name":"Graph bandwidth","score":0.326200008392334},{"id":"https://openalex.org/keywords/graph-property","display_name":"Graph property","score":0.3190000057220459}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6509000062942505},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5845999717712402},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5655999779701233},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5008000135421753},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45730000734329224},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4375},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.41449999809265137},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.38260000944137573},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.34689998626708984},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.33880001306533813},{"id":"https://openalex.org/C17169500","wikidata":"https://www.wikidata.org/wiki/Q3033506","display_name":"Null graph","level":5,"score":0.32760000228881836},{"id":"https://openalex.org/C134727501","wikidata":"https://www.wikidata.org/wiki/Q5597073","display_name":"Graph bandwidth","level":5,"score":0.326200008392334},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.3190000057220459},{"id":"https://openalex.org/C5737132","wikidata":"https://www.wikidata.org/wiki/Q1101814","display_name":"Clique-width","level":5,"score":0.30959999561309814},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.3075000047683716},{"id":"https://openalex.org/C200597783","wikidata":"https://www.wikidata.org/wiki/Q4391289","display_name":"Edge-transitive graph","level":5,"score":0.30640000104904175},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.3057999908924103},{"id":"https://openalex.org/C19332903","wikidata":"https://www.wikidata.org/wiki/Q7623247","display_name":"Strength of a graph","level":5,"score":0.3052000105381012},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.2903999984264374},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.28769999742507935},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2874000072479248},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.2847999930381775},{"id":"https://openalex.org/C148067565","wikidata":"https://www.wikidata.org/wiki/Q3323718","display_name":"Moral graph","level":5,"score":0.2761000096797943},{"id":"https://openalex.org/C168291704","wikidata":"https://www.wikidata.org/wiki/Q902252","display_name":"Complement graph","level":5,"score":0.2757999897003174},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26750001311302185},{"id":"https://openalex.org/C199692417","wikidata":"https://www.wikidata.org/wiki/Q7269362","display_name":"Quartic graph","level":5,"score":0.2662999927997589},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.26440000534057617},{"id":"https://openalex.org/C196455857","wikidata":"https://www.wikidata.org/wiki/Q5473264","display_name":"Forward algorithm","level":5,"score":0.25850000977516174},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.25690001249313354},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.2540000081062317}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s0963548319000075","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548319000075","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/E17D06308910088718F987EB1C8A6560/S0963548319000075a.pdf/div-class-title-a-fast-new-algorithm-for-weak-graph-regularity-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1801.05037","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1801.05037","pdf_url":"https://arxiv.org/pdf/1801.05037","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"doi:10.1017/s0963548319000075","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548319000075","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/E17D06308910088718F987EB1C8A6560/S0963548319000075a.pdf/div-class-title-a-fast-new-algorithm-for-weak-graph-regularity-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1171700966","display_name":null,"funder_award_id":"NSF CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1316152686","display_name":"CAREER: Extremal Combinatorics: Methods, Problems, and Challenges","funder_award_id":"1352121","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6894402473","display_name":null,"funder_award_id":"Fellowship","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8308167428","display_name":"PostDoctoral Research Fellowship","funder_award_id":"1705204","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G840359628","display_name":"Random and pseudorandom structures and their applications","funder_award_id":"1362326","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G875320935","display_name":null,"funder_award_id":"DMS 1352121","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2783015638.pdf","grobid_xml":"https://content.openalex.org/works/W2783015638.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W1022649828","https://openalex.org/W1997230618","https://openalex.org/W2004694806","https://openalex.org/W2036871172","https://openalex.org/W2045377861","https://openalex.org/W2048958388","https://openalex.org/W2052318581","https://openalex.org/W2068571612","https://openalex.org/W2072858942","https://openalex.org/W2083580384","https://openalex.org/W2141649469","https://openalex.org/W2405333517","https://openalex.org/W2790907782","https://openalex.org/W4235946010"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"We":[1],"provide":[2],"a":[3,21,32,36,49,53],"deterministic":[4,54],"algorithm":[5,27,55],"that":[6],"finds,":[7],"in":[8,64,80],"\u025b":[9,40,82],"-":[10,41,83],"O":[11,42,84],"(1)":[12,43,86],"n":[13,24,87],"2":[14,88],"time,":[15],"an":[16,29,65,71],"\u025b-regular":[17],"Frieze\u2013Kannan":[18],"partition":[19],"of":[20,31,39,60,62,74],"graph":[22,34,67],"on":[23],"vertices.":[25],"The":[26],"outputs":[28],"approximation":[30],"given":[33],"as":[35],"weighted":[37],"sum":[38],"many":[44],"complete":[45],"bipartite":[46],"graphs.":[47],"As":[48],"corollary,":[50],"we":[51],"give":[52],"for":[56],"estimating":[57],"the":[58],"number":[59],"copies":[61],"H":[63,85],"n-vertex":[66],"G":[68],"up":[69],"to":[70],"additive":[72],"error":[73],"at":[75],"most":[76],"\u025bn":[77],"v(H)":[78],",":[79],"time":[81],".":[89]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2018-01-26T00:00:00"}