{"id":"https://openalex.org/W2565540516","doi":"https://doi.org/10.1145/3055399.3055415","title":"Fully-dynamic minimum spanning forest with improved worst-case update time","display_name":"Fully-dynamic minimum spanning forest with improved worst-case update time","publication_year":2017,"publication_date":"2017-06-15","ids":{"openalex":"https://openalex.org/W2565540516","doi":"https://doi.org/10.1145/3055399.3055415","mag":"2565540516"},"language":"en","primary_location":{"id":"doi:10.1145/3055399.3055415","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3055399.3055415","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-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/A5077977985","display_name":"Christian Wulff\u2010Nilsen","orcid":"https://orcid.org/0000-0002-3699-7821"},"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":true,"raw_author_name":"Christian Wulff-Nilsen","raw_affiliation_strings":["University of Copenhagen, Denmark"],"affiliations":[{"raw_affiliation_string":"University of Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5077977985"],"corresponding_institution_ids":["https://openalex.org/I124055696"],"apc_list":null,"apc_paid":null,"fwci":3.1383,"has_fulltext":false,"cited_by_count":69,"citation_normalized_percentile":{"value":0.95179182,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"1130","last_page":"1143"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9990000128746033,"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"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9976999759674072,"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/T11106","display_name":"Data Management and Algorithms","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/computer-science","display_name":"Computer science","score":0.592207670211792}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.592207670211792}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3055399.3055415","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3055399.3055415","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/21d1d731-78cb-4b8f-b3e9-4a5c51fce7e1","is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/21d1d731-78cb-4b8f-b3e9-4a5c51fce7e1","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Wulff-Nilsen , C 2017 , Fully-dynamic minimum spanning forest with improved worst-case update time . in Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing . Association for Computing Machinery , pp. 1130-1143 , 49th Annual ACM SIGACT Symposium on Theory of Computing , Montreal , Canada , 19/06/2017 . https://doi.org/10.1145/3055399.3055415","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/15","score":0.6299999952316284,"display_name":"Life in Land"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1963524245","https://openalex.org/W1990488650","https://openalex.org/W1992869351","https://openalex.org/W2009695707","https://openalex.org/W2045107949","https://openalex.org/W2045430818","https://openalex.org/W2068888615","https://openalex.org/W2121473031","https://openalex.org/W2128744826","https://openalex.org/W2133521834","https://openalex.org/W2148219949","https://openalex.org/W2395489635","https://openalex.org/W2561675875","https://openalex.org/W2565540516","https://openalex.org/W2571471359","https://openalex.org/W2963504179"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052"],"abstract_inverted_index":{"We":[0],"give":[1],"a":[2,9,76,96,117,155],"Las":[3,167],"Vegas":[4,168],"data":[5,60,169,188],"structure":[6,61,170,189],"which":[7,147],"maintains":[8],"minimum":[10,123,136],"spanning":[11,97,124,137],"forest":[12,98,125,138],"in":[13,35,54,103,154,179],"an":[14,63,100],"n-vertex":[15],"edge-weighted":[16],"undirected":[17],"dynamic":[18,156],"graph":[19,102],"undergoing":[20],"updates":[21],"consisting":[22],"of":[23,26,72,99,146,151,161],"any":[24],"mixture":[25],"edge":[27],"insertions":[28],"and":[29,49],"deletions.":[30],"Each":[31],"update":[32,70,128,176],"is":[33,46,57,112,139,164,177],"supported":[34],"O(n1/2":[36],"-":[37],"c)":[38],"worst-case":[39,69,104,127,180,192],"time":[40,71,105,129,181],"w.h.p.":[41],"where":[42,174],"c":[43],">":[44],"0":[45],"some":[47],"constant,":[48],"this":[50,187],"bound":[51,77],"also":[52],"holds":[53],"expectation.":[55],"This":[56],"the":[58,66,165],"first":[59,115,166],"achieving":[62],"improvement":[64],"over":[65],"O(\u221an)":[67],"deterministic":[68],"Eppstein":[73],"et":[74],"al.,":[75],"that":[78],"has":[79,190],"been":[80],"standing":[81],"for":[82,171],"25":[83],"years.":[84],"In":[85],"fact,":[86],"it":[87],"was":[88],"previously":[89],"not":[90],"even":[91],"known":[92],"how":[93],"to":[94,121,131],"maintain":[95],"unweighted":[101],"polynomially":[106,182],"faster":[107,183],"than":[108,184],"\u0398(\u221an).":[109],"Our":[110],"result":[111,163],"achieved":[113],"by":[114],"giving":[116],"reduction":[118],"from":[119],"fully-dynamic":[120,172],"decremental":[122,135],"preserving":[126],"up":[130],"logarithmic":[132],"factors.":[133],"Then":[134],"solved":[140],"using":[141],"several":[142],"novel":[143],"techniques,":[144],"one":[145],"involves":[148],"keeping":[149],"track":[150],"low-conductance":[152],"cuts":[153],"graph.":[157],"An":[158],"immediate":[159],"corollary":[160],"our":[162],"connectivity":[173],"each":[175],"handled":[178],"\u0398(\u221an)":[185],"w.h.p.;":[186],"O(1)":[191],"query":[193],"time.":[194]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":15},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":1}],"updated_date":"2026-03-09T08:58:05.943551","created_date":"2025-10-10T00:00:00"}