{"id":"https://openalex.org/W2538944508","doi":"https://doi.org/10.1145/3174803","title":"Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time","display_name":"Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time","publication_year":2018,"publication_date":"2018-03-12","ids":{"openalex":"https://openalex.org/W2538944508","doi":"https://doi.org/10.1145/3174803","mag":"2538944508"},"language":"en","primary_location":{"id":"doi:10.1145/3174803","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3174803","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://curis.ku.dk/portal/da/publications/incremental-exact-mincut-in-polylogarithmic-amortized-update-time(2a642cc7-9a17-45b0-9987-59c0f7bc8744).html","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078315645","display_name":"Gramoz Goranci","orcid":"https://orcid.org/0000-0002-9603-2255"},"institutions":[{"id":"https://openalex.org/I129774422","display_name":"University of Vienna","ror":"https://ror.org/03prydq77","country_code":"AT","type":"education","lineage":["https://openalex.org/I129774422"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Gramoz Goranci","raw_affiliation_strings":["University of Vienna, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Vienna, Austria","institution_ids":["https://openalex.org/I129774422"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003641345","display_name":"Monika Henzinger","orcid":"https://orcid.org/0000-0002-5008-6530"},"institutions":[{"id":"https://openalex.org/I129774422","display_name":"University of Vienna","ror":"https://ror.org/03prydq77","country_code":"AT","type":"education","lineage":["https://openalex.org/I129774422"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Monika Henzinger","raw_affiliation_strings":["University of Vienna, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Vienna, Austria","institution_ids":["https://openalex.org/I129774422"]}]},{"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":["University of Copenhagen, Copenhagen East, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Copenhagen, Copenhagen East, Denmark","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1449,"has_fulltext":true,"cited_by_count":19,"citation_normalized_percentile":{"value":0.88497036,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"14","issue":"2","first_page":"1","last_page":"21"},"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.9994999766349792,"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.9994999766349792,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9933000206947327,"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"}},{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9919999837875366,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/ackermann-function","display_name":"Ackermann function","score":0.8372209668159485},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7348080277442932},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7074301242828369},{"id":"https://openalex.org/keywords/amortized-analysis","display_name":"Amortized analysis","score":0.6815605759620667},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.5858663320541382},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5844281911849976},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.494552344083786},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4793587327003479},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4389101564884186},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4377833604812622},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4141477942466736},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37363165616989136},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.346829891204834},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.15688058733940125}],"concepts":[{"id":"https://openalex.org/C33436860","wikidata":"https://www.wikidata.org/wiki/Q341835","display_name":"Ackermann function","level":3,"score":0.8372209668159485},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7348080277442932},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7074301242828369},{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.6815605759620667},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.5858663320541382},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5844281911849976},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.494552344083786},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4793587327003479},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4389101564884186},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4377833604812622},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4141477942466736},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37363165616989136},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.346829891204834},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15688058733940125},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3174803","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3174803","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/2a642cc7-9a17-45b0-9987-59c0f7bc8744","is_oa":true,"landing_page_url":"https://curis.ku.dk/portal/da/publications/incremental-exact-mincut-in-polylogarithmic-amortized-update-time(2a642cc7-9a17-45b0-9987-59c0f7bc8744).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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/2a642cc7-9a17-45b0-9987-59c0f7bc8744","is_oa":true,"landing_page_url":"https://curis.ku.dk/portal/da/publications/incremental-exact-mincut-in-polylogarithmic-amortized-update-time(2a642cc7-9a17-45b0-9987-59c0f7bc8744).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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W976211528","https://openalex.org/W1496921672","https://openalex.org/W1507039213","https://openalex.org/W1543491698","https://openalex.org/W1591488944","https://openalex.org/W1618327071","https://openalex.org/W1964510837","https://openalex.org/W1977458171","https://openalex.org/W1981519953","https://openalex.org/W1983754496","https://openalex.org/W1990802213","https://openalex.org/W1996575062","https://openalex.org/W1997010704","https://openalex.org/W2012287357","https://openalex.org/W2018804864","https://openalex.org/W2038708787","https://openalex.org/W2064493067","https://openalex.org/W2098983955","https://openalex.org/W2106352538","https://openalex.org/W2120239049","https://openalex.org/W2145527475","https://openalex.org/W2146507303","https://openalex.org/W2148219949","https://openalex.org/W2150516767","https://openalex.org/W2153715991","https://openalex.org/W2279278398","https://openalex.org/W2552989217","https://openalex.org/W2569104968","https://openalex.org/W2611854190","https://openalex.org/W2752885492","https://openalex.org/W2917094338","https://openalex.org/W2949915058","https://openalex.org/W2952276851","https://openalex.org/W4247278211","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W8290509","https://openalex.org/W2184537587","https://openalex.org/W2065411828","https://openalex.org/W2013923536","https://openalex.org/W3092127654","https://openalex.org/W1482484961","https://openalex.org/W4246145339","https://openalex.org/W2076407808","https://openalex.org/W2006811735","https://openalex.org/W2018777660"],"abstract_inverted_index":{"We":[0,98],"present":[1],"a":[2,12,53,72,131,148],"deterministic":[3],"incremental":[4,93,102],"algorithm":[5,67,94,127,146,155],"for":[6,58,104,181],"exactly":[7],"maintaining":[8],"the":[9,59,105,145,151,182],"size":[10],"of":[11,75,95,133,184],"minimum":[13,63,106,152],"cut":[14,64,107],"with":[15,142],"O":[16,31,116,157],"(log":[17],"3":[18,163],"n":[19,23,118,120,160,164,178],"log":[20,21,119,162],"2":[22,122,166],")":[24,123,161,167,179],"amortized":[25,168],"time":[26,170],"per":[27],"edge":[28,134],"insertion":[29],"and":[30,77,87,90,141,171],"(1)":[32],"query":[33,173],"time.":[34],"This":[35],"result":[36],"partially":[37],"answers":[38],"an":[39,91,115,138],"open":[40],"question":[41],"posed":[42],"by":[43,70,84],"Thorup":[44,78],"(2007).":[45],"It":[46],"also":[47,99],"stays":[48],"in":[49],"sharp":[50],"contrast":[51],"to":[52,150],"polynomial":[54],"conditional":[55],"lower":[56],"bound":[57],"fully":[60],"dynamic":[61],"weighted":[62],"problem.":[65,108],"Our":[66],"is":[68],"obtained":[69],"combining":[71],"sparsification":[73],"technique":[74],"Kawarabayashi":[76],"(2015)":[79],"or":[80],"its":[81],"recent":[82],"improvement":[83],"Henzinger,":[85],"Rao,":[86],"Wang":[88],"(2017),":[89],"exact":[92],"Henzinger":[96],"(1997).":[97],"study":[100],"space-efficient":[101],"algorithms":[103],"Concretely,":[109],"we":[110],"show":[111],"that":[112,128],"there":[113],"exists":[114],"(":[117,159,177],"/\u03b5":[121],"space":[124],"Monte":[125],"Carlo":[126],"can":[129],"process":[130],"stream":[132],"insertions":[135],"starting":[136],"from":[137],"empty":[139],"graph,":[140],"high":[143],"probability,":[144],"maintains":[147],"(1+\u03b5)-approximation":[149],"cut.":[153],"The":[154],"has":[156],"((\u03b1":[158],")/\u03b5":[165],"update":[169],"constant":[172],"time,":[174],"where":[175],"\u03b1":[176],"stands":[180],"inverse":[183],"Ackermann":[185],"function.":[186]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}