{"id":"https://openalex.org/W2861707247","doi":"https://doi.org/10.1145/3210377.3210393","title":"Parallel Minimum Cuts in Near-linear Work and Low Depth","display_name":"Parallel Minimum Cuts in Near-linear Work and Low Depth","publication_year":2018,"publication_date":"2018-07-11","ids":{"openalex":"https://openalex.org/W2861707247","doi":"https://doi.org/10.1145/3210377.3210393","mag":"2861707247"},"language":"en","primary_location":{"id":"doi:10.1145/3210377.3210393","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3210377.3210393","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/20.500.11850/504069","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5061867758","display_name":"Barbara Geissmann","orcid":"https://orcid.org/0000-0002-9236-8798"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Barbara Geissmann","raw_affiliation_strings":["ETH Z\u00fcrich, Z\u00fcrich, Switzerland"],"affiliations":[{"raw_affiliation_string":"ETH Z\u00fcrich, Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052014295","display_name":"Lukas Gianinazzi","orcid":"https://orcid.org/0000-0001-5975-4526"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Lukas Gianinazzi","raw_affiliation_strings":["ETH Z\u00fcrich, Z\u00fcrich, Switzerland"],"affiliations":[{"raw_affiliation_string":"ETH Z\u00fcrich, Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5061867758"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":null,"apc_paid":null,"fwci":1.7093,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.86241257,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"11"},"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.9998000264167786,"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.9998000264167786,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9973999857902527,"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.9968000054359436,"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/logarithm","display_name":"Logarithm","score":0.7692173719406128},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5750595331192017},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5374579429626465},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5277168154716492},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5169086456298828},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5121304988861084},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4926634430885315},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.4407898783683777},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43790918588638306},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.428966760635376},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39929068088531494},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3908956050872803},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37033212184906006},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06457439064979553}],"concepts":[{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.7692173719406128},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5750595331192017},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5374579429626465},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5277168154716492},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5169086456298828},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5121304988861084},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4926634430885315},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.4407898783683777},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43790918588638306},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.428966760635376},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39929068088531494},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3908956050872803},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37033212184906006},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06457439064979553},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3210377.3210393","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3210377.3210393","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:www.research-collection.ethz.ch:20.500.11850/504069","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.11850/504069","pdf_url":null,"source":{"id":"https://openalex.org/S4306402302","display_name":"Repository for Publications and Research Data (ETH Zurich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I35440088","host_organization_name":"ETH Zurich","host_organization_lineage":["https://openalex.org/I35440088"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel Computing, 8 (2)","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:arXiv.org:1807.09524","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1807.09524","pdf_url":"https://arxiv.org/pdf/1807.09524","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"},{"id":"doi:10.3929/ethz-b-000504069","is_oa":true,"landing_page_url":"https://doi.org/10.3929/ethz-b-000504069","pdf_url":null,"source":{"id":"https://openalex.org/S7407051236","display_name":"ETH Z\u00fcrich Research Collection","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"pmh:oai:www.research-collection.ethz.ch:20.500.11850/504069","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.11850/504069","pdf_url":null,"source":{"id":"https://openalex.org/S4306402302","display_name":"Repository for Publications and Research Data (ETH Zurich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I35440088","host_organization_name":"ETH Zurich","host_organization_lineage":["https://openalex.org/I35440088"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel Computing, 8 (2)","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W83289625","https://openalex.org/W1513982482","https://openalex.org/W1580899643","https://openalex.org/W1584086289","https://openalex.org/W1769049279","https://openalex.org/W1963524245","https://openalex.org/W1964510837","https://openalex.org/W1975407578","https://openalex.org/W1978583881","https://openalex.org/W1983465613","https://openalex.org/W1983572666","https://openalex.org/W2007470648","https://openalex.org/W2013444956","https://openalex.org/W2014682451","https://openalex.org/W2018804864","https://openalex.org/W2020022171","https://openalex.org/W2038176627","https://openalex.org/W2046946959","https://openalex.org/W2053913299","https://openalex.org/W2057463094","https://openalex.org/W2064493067","https://openalex.org/W2069323107","https://openalex.org/W2075900721","https://openalex.org/W2090359754","https://openalex.org/W2095875205","https://openalex.org/W2121204510","https://openalex.org/W2130566259","https://openalex.org/W2134422938","https://openalex.org/W2168919539","https://openalex.org/W2436525433","https://openalex.org/W2606003984","https://openalex.org/W2956049318","https://openalex.org/W3014094413","https://openalex.org/W4293763691"],"related_works":["https://openalex.org/W2099915933","https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W2044443696","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W1561849181","https://openalex.org/W3081212354"],"abstract_inverted_index":{"We":[0],"present":[1],"the":[2,31,47,82,102],"first":[3],"near-linear":[4],"work":[5,29,57],"and":[6,41,58,79,87],"poly-logritharithmic":[7],"depth":[8,24],"algorithm":[9,45,97],"for":[10],"computing":[11],"a":[12,16,36,68,77,110],"minimum":[13,85,111],"cut":[14],"in":[15,30,53,76],"graph,":[17],"while":[18],"previous":[19],"parallel":[20],"algorithms":[21],"with":[22,38,50],"poly-logarithmic":[23],"required":[25],"at":[26],"least":[27],"quadratic":[28],"number":[32,103],"of":[33,91,104],"vertices.":[34],"In":[35,94],"graph":[37],"n":[39],"vertices":[40],"m":[42],"edges,":[43],"our":[44,96],"computes":[46],"correct":[48],"result":[49,63],"high":[51],"probability":[52],"$O(m":[54],"\u0142og^4":[55],"n)$":[56,60],"$O(\u0142og^3":[59],"depth.":[61],"This":[62],"is":[64],"obtained":[65],"by":[66,80],"parallelizing":[67],"data":[69],"structure":[70],"that":[71],"aggregates":[72],"weights":[73],"along":[74],"paths":[75],"tree":[78],"exploiting":[81],"connection":[83],"between":[84],"cuts":[86],"approximate":[88],"maximum":[89],"packings":[90],"spanning":[92],"trees.":[93],"addition,":[95],"improves":[98],"upon":[99],"bounds":[100],"on":[101],"cache":[105],"misses":[106],"incurred":[107],"to":[108],"compute":[109],"cut.":[112]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}