{"id":"https://openalex.org/W2998970133","doi":"https://doi.org/10.1137/18m1180335","title":"Local Flow Partitioning for Faster Edge Connectivity","display_name":"Local Flow Partitioning for Faster Edge Connectivity","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W2998970133","doi":"https://doi.org/10.1137/18m1180335","mag":"2998970133"},"language":"en","primary_location":{"id":"doi:10.1137/18m1180335","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1180335","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003641345","display_name":"Monika Henzinger","orcid":"https://orcid.org/0000-0002-5008-6530"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Monika Henzinger","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082369624","display_name":"Satish Rao","orcid":"https://orcid.org/0000-0002-7353-333X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Satish Rao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5100401466","display_name":"Di Wang","orcid":"https://orcid.org/0000-0003-0891-0255"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Di Wang","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-0891-0255","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.9338,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.88873188,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":"49","issue":"1","first_page":"1","last_page":"36"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/minimum-cut","display_name":"Minimum cut","score":0.7546523809432983},{"id":"https://openalex.org/keywords/subroutine","display_name":"Subroutine","score":0.6968207359313965},{"id":"https://openalex.org/keywords/conductance","display_name":"Conductance","score":0.5615332126617432},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5567408800125122},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5215763449668884},{"id":"https://openalex.org/keywords/eulerian-path","display_name":"Eulerian path","score":0.5181861519813538},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.49602779746055603},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4767221510410309},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47525307536125183},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4686554968357086},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.4606736898422241},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.4471380114555359},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39282283186912537},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3505169153213501},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.08046230673789978}],"concepts":[{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.7546523809432983},{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.6968207359313965},{"id":"https://openalex.org/C121932024","wikidata":"https://www.wikidata.org/wiki/Q5159376","display_name":"Conductance","level":2,"score":0.5615332126617432},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5567408800125122},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5215763449668884},{"id":"https://openalex.org/C43058520","wikidata":"https://www.wikidata.org/wiki/Q624580","display_name":"Eulerian path","level":3,"score":0.5181861519813538},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.49602779746055603},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4767221510410309},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47525307536125183},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4686554968357086},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4606736898422241},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.4471380114555359},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39282283186912537},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3505169153213501},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.08046230673789978},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C53469067","wikidata":"https://www.wikidata.org/wiki/Q505735","display_name":"Lagrangian","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/18m1180335","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1180335","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2954400926","display_name":null,"funder_award_id":"CCF-1535989","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6353528903","display_name":"Challenges in Graph Algorithms with Applications","funder_award_id":"340506","funder_id":"https://openalex.org/F4320338352","funder_display_name":"FP7 Ideas: European Research Council"},{"id":"https://openalex.org/G7224857386","display_name":null,"funder_award_id":"CCF-1528174","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"},{"id":"https://openalex.org/F4320338352","display_name":"FP7 Ideas: European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1964510837","https://openalex.org/W1984361668","https://openalex.org/W2034331023","https://openalex.org/W2057463094","https://openalex.org/W2088844265","https://openalex.org/W2115049345","https://openalex.org/W2135512436","https://openalex.org/W2147133278","https://openalex.org/W2159000620","https://openalex.org/W2963972775","https://openalex.org/W3031108707"],"related_works":["https://openalex.org/W2121204510","https://openalex.org/W2095284441","https://openalex.org/W2141353198","https://openalex.org/W3141688457","https://openalex.org/W3155269421","https://openalex.org/W2186707160","https://openalex.org/W2590727506","https://openalex.org/W2078695342","https://openalex.org/W1974018476","https://openalex.org/W647071796"],"abstract_inverted_index":{"We":[0,131],"study":[1],"the":[2,29,49,89,98,108,211],"problem":[3],"of":[4,36,56,91,158,226],"computing":[5],"a":[6,10,16,92,127,134,155],"minimum":[7],"cut":[8],"in":[9],"simple,":[11],"undirected":[12],"graph":[13,94,99,112],"and":[14,41,48,110,138,151,217],"give":[15],"deterministic":[17,33],"$O(m":[18,37,57],"\\log^2":[19],"n":[20],"\\log\\log^2":[21],"n)$":[22,39,59],"time":[23,35,55],"algorithm.":[24,130],"This":[25],"improves":[26],"on":[27],"both":[28,214],"best":[30,50],"previously":[31,51],"known":[32,52],"running":[34,54],"\\log^{12}":[38],"(Kawarabayashi":[40],"Thorup":[42,111],"[J.":[43,61],"ACM,":[44,62],"66":[45],"(2018),":[46],"4])":[47],"randomized":[53],"\\log^{3}":[58],"(Karger":[60],"47":[63],"(2000),":[64],"pp.":[65],"46--76])":[66],"for":[67,192],"this":[68],"problem,":[69],"though":[70],"Karger's":[71],"algorithm":[72,137],"can":[73],"be":[74,225],"further":[75],"applied":[76,160],"to":[77,84,101,143,161,180,198],"weighted":[78],"graphs.":[79],"Moreover,":[80],"our":[81,146],"result":[82],"extends":[83],"balanced":[85],"directed":[86,93],"graphs,":[87],"where":[88],"balance":[90],"captures":[95],"how":[96],"close":[97],"is":[100,106,177,210,215],"being":[102,159],"Eulerian.":[103],"Our":[104,206],"approach":[105],"using":[107],"Kawarabayashi":[109],"compression":[113],"technique,":[114],"which":[115],"repeatedly":[116],"finds":[117],"low":[118,163,203,219],"conductance":[119,164,204,220],"cuts.":[120,165,205,221],"To":[121],"find":[122],"these":[123],"cuts":[124],"they":[125],"use":[126,132],"diffusion-based":[128,152],"local":[129,136,193,216],"instead":[133],"flow-based":[135,147,194],"suitably":[139],"adjust":[140],"their":[141],"framework":[142],"work":[144,187],"with":[145,196],"subroutine.":[148],"Both":[149],"flow-":[150],"methods":[153,183],"have":[154,168],"long":[156],"history":[157],"finding":[162],"Diffusion":[166],"algorithms":[167,195],"several":[169],"variants":[170],"that":[171,213],"are":[172],"naturally":[173],"local,":[174],"while":[175],"it":[176,223],"more":[178],"complicated":[179],"make":[181],"flow":[182,207],"local.":[184],"Some":[185],"prior":[186],"has":[188],"proven":[189],"nice":[190],"properties":[191],"respect":[197],"improving":[199],"or":[200],"cleaning":[201],"up":[202],"subroutine,":[208],"however,":[209],"first":[212],"produces":[218],"Thus,":[222],"may":[224],"independent":[227],"interest.":[228]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}