{"id":"https://openalex.org/W3006157595","doi":"https://doi.org/10.1145/3350755.3400241","title":"Work-Efficient Batch-Incremental Minimum Spanning Trees with Applications to the Sliding-Window Model","display_name":"Work-Efficient Batch-Incremental Minimum Spanning Trees with Applications to the Sliding-Window Model","publication_year":2020,"publication_date":"2020-07-06","ids":{"openalex":"https://openalex.org/W3006157595","doi":"https://doi.org/10.1145/3350755.3400241","mag":"3006157595"},"language":"en","primary_location":{"id":"doi:10.1145/3350755.3400241","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3350755.3400241","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3350755.3400241","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3350755.3400241","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Daniel Anderson","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel Anderson","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Guy E. Blelloch","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guy E. Blelloch","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":null,"display_name":"Kanat Tangwongsan","orcid":null},"institutions":[{"id":"https://openalex.org/I25399158","display_name":"Mahidol University","ror":"https://ror.org/01znkr924","country_code":"TH","type":"education","lineage":["https://openalex.org/I25399158"]}],"countries":["TH"],"is_corresponding":false,"raw_author_name":"Kanat Tangwongsan","raw_affiliation_strings":["Mahidol University International College, Bangkok, Thailand"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mahidol University International College, Bangkok, Thailand","institution_ids":["https://openalex.org/I25399158"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7285,"has_fulltext":true,"cited_by_count":11,"citation_normalized_percentile":{"value":0.75947765,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"51","last_page":"61"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9969000220298767,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/spanning-tree","display_name":"Spanning tree","score":0.7250000238418579},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6597999930381775},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.48249998688697815},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.46000000834465027},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.4431000053882599},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.4235000014305115},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4228000044822693},{"id":"https://openalex.org/keywords/reverse-delete-algorithm","display_name":"Reverse-delete algorithm","score":0.4165000021457672},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.415800005197525},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4147999882698059}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7250000238418579},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6597999930381775},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49950000643730164},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.483599990606308},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.48249998688697815},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46000000834465027},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.4431000053882599},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.4235000014305115},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4228000044822693},{"id":"https://openalex.org/C199346575","wikidata":"https://www.wikidata.org/wiki/Q4925151","display_name":"Reverse-delete algorithm","level":4,"score":0.4165000021457672},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.415800005197525},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4147999882698059},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41040000319480896},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4077000021934509},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.3944000005722046},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.37459999322891235},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.3734000027179718},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3587000072002411},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3467999994754791},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.33660000562667847},{"id":"https://openalex.org/C1649724","wikidata":"https://www.wikidata.org/wiki/Q470813","display_name":"Prim's algorithm","level":4,"score":0.3328000009059906},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.32749998569488525},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.3174000084400177},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.311599999666214},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3050000071525574},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.29829999804496765},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2912999987602234},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.2897000014781952},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.28619998693466187},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.28439998626708984},{"id":"https://openalex.org/C62692426","wikidata":"https://www.wikidata.org/wiki/Q816319","display_name":"Depth-first search","level":3,"score":0.28349998593330383},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28349998593330383},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2750999927520752},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2718999981880188},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.2678000032901764},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.26420000195503235},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2614000141620636},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2574999928474426}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3350755.3400241","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3350755.3400241","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3350755.3400241","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2002.05710","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2002.05710","pdf_url":"https://arxiv.org/pdf/2002.05710","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"}],"best_oa_location":{"id":"doi:10.1145/3350755.3400241","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3350755.3400241","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3350755.3400241","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1574315406","display_name":null,"funder_award_id":"CCF-1408940","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1814763051","display_name":"AF: Small: Shared-Memory Parallel Algorithms: Theory and Practice","funder_award_id":"1910030","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6550909468","display_name":null,"funder_award_id":"CCF-1919223","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7081150942","display_name":null,"funder_award_id":"CCF-1901381, CCF-1910030, and CCF-1919223","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7587430710","display_name":"SHF: Medium: Algorithmic lambda-Calculus for the Design, Analysis, and Implementation of Parallel Algorithms","funder_award_id":"1901381","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G82646606","display_name":"SPX: Parallel Models and Algorithms for Emerging Memory Systems","funder_award_id":"1919223","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"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3006157595.pdf","grobid_xml":"https://content.openalex.org/works/W3006157595.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W176067329","https://openalex.org/W1513400187","https://openalex.org/W1532566247","https://openalex.org/W1556606822","https://openalex.org/W1561849018","https://openalex.org/W1781103926","https://openalex.org/W1965680834","https://openalex.org/W1965859781","https://openalex.org/W1986973819","https://openalex.org/W1990488650","https://openalex.org/W2004110412","https://openalex.org/W2009695707","https://openalex.org/W2017927472","https://openalex.org/W2045430818","https://openalex.org/W2049247788","https://openalex.org/W2056942590","https://openalex.org/W2065634943","https://openalex.org/W2080566336","https://openalex.org/W2082227928","https://openalex.org/W2110002382","https://openalex.org/W2121473031","https://openalex.org/W2138304862","https://openalex.org/W2169155148","https://openalex.org/W2436525433","https://openalex.org/W2533878290","https://openalex.org/W2958706771","https://openalex.org/W3000941460","https://openalex.org/W4230889046"],"related_works":[],"abstract_inverted_index":{"Algorithms":[0],"for":[1,26,43,57,84],"dynamically":[2],"maintaining":[3,144],"minimum":[4],"spanning":[5],"trees":[6],"(MSTs)":[7],"have":[8],"received":[9],"much":[10],"attention":[11],"in":[12,39,65,69,127,129],"both":[13],"the":[14,40,51,130],"parallel":[15,31,54,128],"and":[16,71,143],"sequential":[17],"settings.":[18],"While":[19],"previous":[20],"work":[21,36,68],"has":[22],"given":[23,107],"optimal":[24],"algorithms":[25,33],"dense":[27],"graphs,":[28],"all":[29,101],"existing":[30],"batch-dynamic":[32,55],"perform":[34],"polynomial":[35],"per":[37],"update":[38],"worst":[41],"case":[42],"sparse":[44],"graphs.":[45],"In":[46],"this":[47],"paper,":[48],"we":[49,117],"present":[50],"first":[52],"work-efficient":[53],"algorithm":[56,80,83],"incremental":[58],"MST,":[59],"which":[60,94],"can":[61],"insert":[62],"l":[63],"edges":[64,104],"O(l":[66],"log(1+n/l)":[67],"expectation":[70],"O(polylog(n))":[72],"span":[73],"w.h.p.":[74],"The":[75],"key":[76],"ingredient":[77],"of":[78,90,109,121],"our":[79,113],"is":[81,95],"an":[82,91],"constructing":[85],"a":[86,96,106,119],"compressed":[87],"path":[88],"tree":[89,98],"edge-weighted":[92],"tree,":[93],"smaller":[97],"that":[99,123],"contains":[100],"pairwise":[102],"heaviest":[103],"between":[105],"set":[108],"marked":[110],"vertices.":[111],"Using":[112],"batch-incremental":[114],"MST":[115],"algorithm,":[116],"demonstrate":[118],"range":[120],"applications":[122],"become":[124],"efficiently":[125],"solvable":[126],"sliding-window":[131],"model,":[132],"such":[133],"as":[134],"graph":[135],"connectivity,":[136],"approximate":[137],"MSTs,":[138],"testing":[139],"bipartiteness,":[140],"k-certificates,":[141],"cycle-freeness,":[142],"sparsifiers.":[145]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2020-02-24T00:00:00"}