{"id":"https://openalex.org/W2983782154","doi":"https://doi.org/10.1145/3357713.3384334","title":"Weighted min-cut: sequential, cut-query, and streaming algorithms","display_name":"Weighted min-cut: sequential, cut-query, and streaming algorithms","publication_year":2020,"publication_date":"2020-06-22","ids":{"openalex":"https://openalex.org/W2983782154","doi":"https://doi.org/10.1145/3357713.3384334","mag":"2983782154"},"language":"en","primary_location":{"id":"doi:10.1145/3357713.3384334","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357713.3384334","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1911.01651","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050217636","display_name":"Sagnik Mukhopadhyay","orcid":"https://orcid.org/0000-0002-3722-4679"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Sagnik Mukhopadhyay","raw_affiliation_strings":["KTH, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KTH, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074369690","display_name":"Danupon Nanongkai","orcid":"https://orcid.org/0000-0003-4468-2675"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Danupon Nanongkai","raw_affiliation_strings":["KTH, Sweden"],"raw_orcid":"https://orcid.org/0000-0003-4468-2675","affiliations":[{"raw_affiliation_string":"KTH, Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":10.1171,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.99314188,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"496","last_page":"509"},"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.9995999932289124,"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.9995999932289124,"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9983999729156494,"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/T10237","display_name":"Cryptography and Data Security","score":0.994700014591217,"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/combinatorics","display_name":"Combinatorics","score":0.7812231779098511},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.684320867061615},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.6374450325965881},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.6204891204833984},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5842563509941101},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5141244530677795},{"id":"https://openalex.org/keywords/subroutine","display_name":"Subroutine","score":0.513976514339447},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4978196620941162},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.42331576347351074},{"id":"https://openalex.org/keywords/streaming-algorithm","display_name":"Streaming algorithm","score":0.413443386554718},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35109007358551025},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34853535890579224},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1577179729938507}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7812231779098511},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.684320867061615},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.6374450325965881},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.6204891204833984},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5842563509941101},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5141244530677795},{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.513976514339447},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4978196620941162},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.42331576347351074},{"id":"https://openalex.org/C187166803","wikidata":"https://www.wikidata.org/wiki/Q2835831","display_name":"Streaming algorithm","level":3,"score":0.413443386554718},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35109007358551025},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34853535890579224},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1577179729938507},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3357713.3384334","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357713.3384334","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:eprints.whiterose.ac.uk:200975","is_oa":false,"landing_page_url":"https://eprints.whiterose.ac.uk/200975/1/1911.01651.pdf","pdf_url":"https://eprints.whiterose.ac.uk/200975/1/1911.01651.pdf","source":{"id":"https://openalex.org/S4306400854","display_name":"White Rose Research Online (University of Leeds, The University of Sheffield, University of York)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2800616092","host_organization_name":"White Rose University Consortium","host_organization_lineage":["https://openalex.org/I2800616092"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Proceedings Paper"},{"id":"pmh:oai:arXiv.org:1911.01651","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1911.01651","pdf_url":"https://arxiv.org/pdf/1911.01651","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":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1911.01651","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1911.01651","pdf_url":"https://arxiv.org/pdf/1911.01651","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":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8727312542","display_name":null,"funder_award_id":"715672","funder_id":"https://openalex.org/F4320338352","funder_display_name":"FP7 Ideas: European Research Council"}],"funders":[{"id":"https://openalex.org/F4320338352","display_name":"FP7 Ideas: European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":54,"referenced_works":["https://openalex.org/W1496921672","https://openalex.org/W1592346261","https://openalex.org/W1606421799","https://openalex.org/W1886894033","https://openalex.org/W1927738121","https://openalex.org/W1964510837","https://openalex.org/W1985273367","https://openalex.org/W1992869351","https://openalex.org/W1997010704","https://openalex.org/W1998730018","https://openalex.org/W2011999472","https://openalex.org/W2018804864","https://openalex.org/W2045430818","https://openalex.org/W2060383163","https://openalex.org/W2080237261","https://openalex.org/W2085933841","https://openalex.org/W2105016507","https://openalex.org/W2119885577","https://openalex.org/W2150516767","https://openalex.org/W2153968170","https://openalex.org/W2165753192","https://openalex.org/W2183729464","https://openalex.org/W2188455456","https://openalex.org/W2395489635","https://openalex.org/W2569104968","https://openalex.org/W2591972614","https://openalex.org/W2611854190","https://openalex.org/W2748968962","https://openalex.org/W2767688676","https://openalex.org/W2939043023","https://openalex.org/W2953105294","https://openalex.org/W2953264324","https://openalex.org/W2963702123","https://openalex.org/W2963972775","https://openalex.org/W2964264613","https://openalex.org/W2983359005","https://openalex.org/W3000941460","https://openalex.org/W3037465333","https://openalex.org/W3105495033","https://openalex.org/W3128057791","https://openalex.org/W3144947242","https://openalex.org/W3168134475","https://openalex.org/W3175265138","https://openalex.org/W4229720786","https://openalex.org/W4230889046","https://openalex.org/W4230894037","https://openalex.org/W4238411931","https://openalex.org/W4238450186","https://openalex.org/W4288245702","https://openalex.org/W4288374293","https://openalex.org/W4297804874","https://openalex.org/W4300030091","https://openalex.org/W4300142023","https://openalex.org/W4300837171"],"related_works":["https://openalex.org/W4390092937","https://openalex.org/W2951231217","https://openalex.org/W4300287281","https://openalex.org/W2126169066","https://openalex.org/W2086366030","https://openalex.org/W2983782154","https://openalex.org/W4287692398","https://openalex.org/W3144947242","https://openalex.org/W3047118271","https://openalex.org/W2148219949"],"abstract_inverted_index":{"Consider":[0],"the":[1,17,21,63],"following":[2,64],"2-respecting":[3],"min-cut":[4,42,66],"problem.":[5],"Given":[6],"any":[7],"weighted":[8,69],"graph":[9],"G":[10],"and":[11],"its":[12],"spanning":[13],"tree":[14],"T,":[15],"find":[16],"minimum":[18],"cut":[19],"among":[20],"cuts":[22],"that":[23],"contain":[24],"at":[25],"most":[26],"two":[27],"edges":[28],"in":[29,37,58],"T.":[30],"This":[31],"problem":[32,52],"is":[33],"an":[34],"important":[35],"subroutine":[36],"Karger\u2019s":[38],"celebrated":[39],"randomized":[40,65],"near-linear-time":[41],"algorithm":[43],"[STOC\u201996].":[44],"We":[45],"present":[46],"a":[47],"new":[48],"approach":[49],"for":[50,68],"this":[51],"which":[53],"can":[54],"be":[55],"easily":[56],"implemented":[57],"many":[59],"settings,":[60],"leading":[61],"to":[62],"algorithms":[67],"graphs.":[70]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}