{"id":"https://openalex.org/W2121473031","doi":"https://doi.org/10.1137/0214055","title":"Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications","display_name":"Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications","publication_year":1985,"publication_date":"1985-11-01","ids":{"openalex":"https://openalex.org/W2121473031","doi":"https://doi.org/10.1137/0214055","mag":"2121473031"},"language":"en","primary_location":{"id":"doi:10.1137/0214055","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0214055","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015188847","display_name":"Greg N. Frederickson","orcid":null},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Greg N. Frederickson","raw_affiliation_strings":["Purdue University"],"affiliations":[{"raw_affiliation_string":"Purdue University","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5015188847"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":9.7604,"has_fulltext":false,"cited_by_count":382,"citation_normalized_percentile":{"value":0.98141809,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"14","issue":"4","first_page":"781","last_page":"798"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9950000047683716,"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/spanning-tree","display_name":"Spanning tree","score":0.8415712714195251},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7780460119247437},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6268746256828308},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.6266977190971375},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5888907313346863},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.553766667842865},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.5363733768463135},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5109137892723083},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.43535593152046204},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.4339229166507721},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.42127281427383423},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.42020711302757263},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38739311695098877},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36931687593460083}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8415712714195251},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7780460119247437},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6268746256828308},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.6266977190971375},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5888907313346863},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.553766667842865},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.5363733768463135},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5109137892723083},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.43535593152046204},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.4339229166507721},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.42127281427383423},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.42020711302757263},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38739311695098877},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36931687593460083},{"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.1137/0214055","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0214055","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:docs.lib.purdue.edu:cstech-1367","is_oa":false,"landing_page_url":"https://docs.lib.purdue.edu/cstech/368","pdf_url":null,"source":{"id":"https://openalex.org/S4377196310","display_name":"Purdue e-Pubs (Purdue University System)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801333002","host_organization_name":"Purdue University System","host_organization_lineage":["https://openalex.org/I2801333002"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Department of Computer Science Technical Reports","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W1973942323","https://openalex.org/W1979630448","https://openalex.org/W1986022261","https://openalex.org/W2009938762","https://openalex.org/W2018804864","https://openalex.org/W2023658462","https://openalex.org/W2049596277","https://openalex.org/W2071845176","https://openalex.org/W2085849292","https://openalex.org/W2091507391","https://openalex.org/W2125690626","https://openalex.org/W2128865241","https://openalex.org/W2132445073","https://openalex.org/W2160907067","https://openalex.org/W2166707550","https://openalex.org/W2186053894","https://openalex.org/W2799004609","https://openalex.org/W4213214460"],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W2943635264","https://openalex.org/W2138987445","https://openalex.org/W2387385213","https://openalex.org/W2014991506","https://openalex.org/W4242086819","https://openalex.org/W2589768050","https://openalex.org/W2074214908","https://openalex.org/W1569529368","https://openalex.org/W1143194816"],"abstract_inverted_index":{"Data":[0],"structures":[1,82],"are":[2,42],"presented":[3,71],"for":[4,87],"the":[5,15,19,25,28,35,40,53,58,61,88,94,98],"problem":[6,92,95],"of":[7,17,21,30,55,63,77,96],"maintaining":[8,34],"a":[9,31,64,67],"minimum":[10],"spanning":[11,101],"tree":[12,41],"on-line":[13,89],"under":[14],"operation":[16],"updating":[18,39],"cost":[20],"some":[22],"edge":[23],"in":[24,57],"graph.":[26,59],"For":[27,60],"case":[29,62],"general":[32],"graph,":[33,66],"data":[36,68],"structure":[37,69],"and":[38,93],"shown":[43],"to":[44,84],"take":[45],"$O(\\sqrt":[46],"m":[47,51],")$":[48],"time,":[49],"where":[50],"is":[52,70],"number":[54],"edges":[56],"planar":[65],"which":[72],"supports":[73],"an":[74],"update":[75],"time":[76],"$O((\\log":[78],"m)^2":[79],")$.":[80],"These":[81],"contribute":[83],"improved":[85],"solutions":[86],"connected":[90],"components":[91],"generating":[97],"K":[99],"smallest":[100],"trees.":[102]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":14},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":13},{"year":2016,"cited_by_count":18},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":11},{"year":2012,"cited_by_count":8}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}