{"id":"https://openalex.org/W2188455456","doi":"https://doi.org/10.1145/3274663","title":"Deterministic Edge Connectivity in Near-Linear Time","display_name":"Deterministic Edge Connectivity in Near-Linear Time","publication_year":2018,"publication_date":"2018-12-12","ids":{"openalex":"https://openalex.org/W2188455456","doi":"https://doi.org/10.1145/3274663","mag":"2188455456"},"language":"en","primary_location":{"id":"doi:10.1145/3274663","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3274663","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1411.5123","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008961593","display_name":"Ken\u2010ichi Kawarabayashi","orcid":"https://orcid.org/0000-0001-6056-4287"},"institutions":[{"id":"https://openalex.org/I184597095","display_name":"National Institute of Informatics","ror":"https://ror.org/04ksd4g47","country_code":"JP","type":"facility","lineage":["https://openalex.org/I1319490839","https://openalex.org/I184597095","https://openalex.org/I4210158934"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Ken-Ichi Kawarabayashi","raw_affiliation_strings":["National Institute of Informatics, Chiyoda-ku, Tokyo, Japan","National Institute of Informatics, Chiyoda-ku, , Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Institute of Informatics, Chiyoda-ku, Tokyo, Japan","institution_ids":["https://openalex.org/I184597095"]},{"raw_affiliation_string":"National Institute of Informatics, Chiyoda-ku, , Tokyo, Japan","institution_ids":["https://openalex.org/I184597095"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039232562","display_name":"Mikkel Thorup","orcid":"https://orcid.org/0000-0001-5237-1709"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Mikkel Thorup","raw_affiliation_strings":["BARC, University of Copenhagen, Denmark","BARC, University of Copenhagen, Denmark#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"BARC, University of Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]},{"raw_affiliation_string":"BARC, University of Copenhagen, Denmark#TAB#","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5144,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.7129551,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"66","issue":"1","first_page":"1","last_page":"50"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994000196456909,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9961000084877014,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.6949684023857117},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6395993232727051},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5886180400848389},{"id":"https://openalex.org/keywords/multigraph","display_name":"Multigraph","score":0.5530650019645691},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5492666363716125},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5240293145179749},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.517099142074585},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.48506203293800354},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.44047749042510986},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.42922818660736084},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3859653174877167},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38497740030288696},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.384941965341568}],"concepts":[{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.6949684023857117},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6395993232727051},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5886180400848389},{"id":"https://openalex.org/C17758045","wikidata":"https://www.wikidata.org/wiki/Q2642629","display_name":"Multigraph","level":3,"score":0.5530650019645691},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5492666363716125},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5240293145179749},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.517099142074585},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.48506203293800354},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.44047749042510986},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.42922818660736084},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3859653174877167},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38497740030288696},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.384941965341568},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1145/3274663","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3274663","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1411.5123","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1411.5123","pdf_url":"https://arxiv.org/pdf/1411.5123","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/abb74f64-f126-4e99-87d2-1bf9f421940c","is_oa":true,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/abb74f64-f126-4e99-87d2-1bf9f421940c","pdf_url":"http://arxiv.org/pdf/1411.5123","source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Kawarabayashi , K & Thorup , M 2019 , ' Deterministic Edge Connectivity in Near-Linear Time ' , Journal of the ACM , vol. 66 , no. 1 , 4 , pp. 1-50 . https://doi.org/10.1145/3274663","raw_type":"article"},{"id":"mag:2188455456","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1411.5123.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:pure.atira.dk:publications/abb74f64-f126-4e99-87d2-1bf9f421940c","is_oa":false,"landing_page_url":"https://curis.ku.dk/portal/da/publications/deterministic-edge-connectivity-in-nearlinear-time(abb74f64-f126-4e99-87d2-1bf9f421940c).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Kawarabayashi , K & Thorup , M 2019 , ' Deterministic Edge Connectivity in Near-Linear Time ' , Journal of the ACM , vol. 66 , no. 1 , 4 , pp. 1-50 . https://doi.org/10.1145/3274663","raw_type":"article"},{"id":"doi:10.48550/arxiv.1411.5123","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1411.5123","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1411.5123","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1411.5123","pdf_url":"https://arxiv.org/pdf/1411.5123","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3405030368","display_name":null,"funder_award_id":"DFF-0602-02499B","funder_id":"https://openalex.org/F4320322928","funder_display_name":"Danmarks Frie Forskningsfond"},{"id":"https://openalex.org/G8230891464","display_name":"Large Graphs: Theory and Algorithms","funder_award_id":"18H05291","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320310490","display_name":"Villum Fonden","ror":"https://ror.org/007ww2d15"},{"id":"https://openalex.org/F4320322928","display_name":"Danmarks Frie Forskningsfond","ror":"https://ror.org/02sptwz63"},{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W976211528","https://openalex.org/W1566746440","https://openalex.org/W1922786313","https://openalex.org/W1964510837","https://openalex.org/W1978918340","https://openalex.org/W1996575062","https://openalex.org/W2006378656","https://openalex.org/W2008292658","https://openalex.org/W2035228443","https://openalex.org/W2045430818","https://openalex.org/W2057463094","https://openalex.org/W2064211276","https://openalex.org/W2064493067","https://openalex.org/W2066636486","https://openalex.org/W2083049364","https://openalex.org/W2121204510","https://openalex.org/W2122799790","https://openalex.org/W2129575457","https://openalex.org/W2145527475","https://openalex.org/W2150516767","https://openalex.org/W2168919539","https://openalex.org/W2342702536","https://openalex.org/W4213060883","https://openalex.org/W4247278211","https://openalex.org/W6677232678"],"related_works":["https://openalex.org/W2953265453","https://openalex.org/W2963972775","https://openalex.org/W1964510837","https://openalex.org/W2970633507","https://openalex.org/W2083049364","https://openalex.org/W2795850823","https://openalex.org/W2950657197","https://openalex.org/W2949380505","https://openalex.org/W1414495935","https://openalex.org/W1543491698","https://openalex.org/W2752747244","https://openalex.org/W2913012475","https://openalex.org/W2900627138","https://openalex.org/W124627512","https://openalex.org/W3167437580","https://openalex.org/W2009281933","https://openalex.org/W2538469359","https://openalex.org/W2110004664","https://openalex.org/W2768170171","https://openalex.org/W2951019513"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,10,18,51,105,134,143,153,193,224],"deterministic":[3,39,74,178],"algorithm":[4,40,45,75,111,137],"that":[5,138,237],"computes":[6],"the":[7,32,42,60,91,113,120,185],"edge-connectivity":[8],"of":[9,64,142,166],"graph":[11,22,146],"in":[12,68,229],"near-linear":[13,69,107,135,179],"time.":[14,70],"This":[15,30],"is":[16,31,46,90,123,133,240],"for":[17,41,112,211],"simple":[19,144],"undirected":[20],"unweighted":[21],"G":[23,147,167],"with":[24,126,148,156,168],"n":[25,86,101],"vertices":[26,172],"and":[27,196,204],"m":[28,83,158],"edges.":[29],"first":[33],"o":[34],"(":[35],"mn":[36],")":[37],"time":[38,108,136,180],"problem.":[43],"Our":[44,129],"easily":[47],"extended":[48],"to":[49],"find":[50],"concrete":[52],"minimum":[53,66,114,125,149,164],"edge-cut.":[54],"In":[55,176],"fact,":[56],"we":[57,182,232],"can":[58,96],"construct":[59],"classic":[61],"cactus":[62],"representation":[63],"all":[65,163],"cuts":[67,165,189,213],"The":[71],"previous":[72],"fastest":[73],"by":[76,201],"Gabow":[77],"from":[78],"STOC":[79],"'91":[80],"took":[81],"\u00d5(":[82,157],"+\u03bb":[84],"2":[85],"),":[87],"where":[88],"\u03bb":[89,95],"edge":[92],"connectivity,":[93],"but":[94,119],"be":[97],"as":[98,100,199],"big":[99],"\u22121.":[102],"Karger":[103],"presented":[104],"randomized":[106,215],"Monte":[109,216],"Carlo":[110,217],"cut":[115,122],"problem":[116,186],"at":[117,169,206],"STOC\u201996,":[118],"returned":[121],"only":[124],"high":[127],"probability.":[128],"main":[130],"technical":[131],"contribution":[132],"contracts":[139],"vertex":[140],"sets":[141],"input":[145],"degree":[150],"\u0394,":[151],"producing":[152],"multigraph":[154],"\u1e20":[155],"/\u0394)":[159],"edges,":[160],"which":[161],"preserves":[162],"least":[170],"two":[171],"on":[173,222],"each":[174],"side.":[175],"our":[177,230],"algorithm,":[181],"will":[183],"decompose":[184],"via":[187],"low-conductance":[188,212],"found":[190],"using":[191],"PageRank":[192],"la":[194],"Brin":[195],"Page":[197],"(1998),":[198],"analyzed":[200],"Andersson,":[202],"Chung,":[203],"Lang":[205],"FOCS\u201906.":[207],"Normally,":[208],"such":[209],"algorithms":[210],"are":[214],"algorithms,":[218],"because":[219],"they":[220],"rely":[221],"guessing":[223,239],"good":[225],"start":[226],"vertex.":[227],"However,":[228],"case,":[231],"have":[233],"so":[234],"much":[235],"structure":[236],"no":[238],"needed.":[241]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}