{"id":"https://openalex.org/W2123839217","doi":"https://doi.org/10.1007/s00453-004-1099-9","title":"Nearly Linear Time Minimum Spanning Tree Maintenance for Transient Node Failures","display_name":"Nearly Linear Time Minimum Spanning Tree Maintenance for Transient Node Failures","publication_year":2004,"publication_date":"2004-06-10","ids":{"openalex":"https://openalex.org/W2123839217","doi":"https://doi.org/10.1007/s00453-004-1099-9","mag":"2123839217"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-004-1099-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-004-1099-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-004-1099-9.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-004-1099-9.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5058595042","display_name":"Enrico Nardelli","orcid":"https://orcid.org/0000-0001-9451-2899"},"institutions":[{"id":"https://openalex.org/I4210162062","display_name":"Istituto di Analisi dei Sistemi ed Informatica Antonio Ruberti","ror":"https://ror.org/054ye0e45","country_code":"IT","type":"facility","lineage":["https://openalex.org/I4210155236","https://openalex.org/I4210162062"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Enrico Nardelli","raw_affiliation_strings":["Dipartimento di Matematica, Universit\u00e0 di Roma \u201cTor Vergata\u201d, Via della Ricerca Scientifica, 00133 Roma,\nItaly and Istituto di Analisi dei Sistemi ed Informatica \u201cA. Ruberti\u201d, CNR, Viale Manzoni 30, 00185 Roma, Italy","Dipartimento di Matematica, Universit\u00e0 di Roma \u201cTor Vergata\u201d, Via della Ricerca Scientifica, 00133 Roma, Italy and Istituto di Analisi dei Sistemi ed Informatica \u201cA. Ru "],"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica, Universit\u00e0 di Roma \u201cTor Vergata\u201d, Via della Ricerca Scientifica, 00133 Roma,\nItaly and Istituto di Analisi dei Sistemi ed Informatica \u201cA. Ruberti\u201d, CNR, Viale Manzoni 30, 00185 Roma, Italy","institution_ids":["https://openalex.org/I4210162062"]},{"raw_affiliation_string":"Dipartimento di Matematica, Universit\u00e0 di Roma \u201cTor Vergata\u201d, Via della Ricerca Scientifica, 00133 Roma, Italy and Istituto di Analisi dei Sistemi ed Informatica \u201cA. Ru ","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087770784","display_name":"Guido Proietti","orcid":"https://orcid.org/0000-0003-1009-5552"},"institutions":[{"id":"https://openalex.org/I26415053","display_name":"University of L'Aquila","ror":"https://ror.org/01j9p1r26","country_code":"IT","type":"education","lineage":["https://openalex.org/I26415053"]},{"id":"https://openalex.org/I4210162062","display_name":"Istituto di Analisi dei Sistemi ed Informatica Antonio Ruberti","ror":"https://ror.org/054ye0e45","country_code":"IT","type":"facility","lineage":["https://openalex.org/I4210155236","https://openalex.org/I4210162062"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Guido Proietti","raw_affiliation_strings":["Dipartimento di Informatica, Universit\u00e0 di L\u2019Aquila, Via Vetoio, 67010 L\u2019Aquila, Italy and Istituto di Analisi\ndei Sistemi ed Informatica \u201cA. Ruberti\u201d, CNR, Viale Manzoni 30, 00185 Roma, Italy","Dipartimento di Informatica, Universit\u00e0 di L\u2019Aquila, Via Vetoio, 67010 L\u2019Aquila, Italy and Istituto di Analisi dei Sistemi ed Informatica \u201cA. Ruberti\u201d, CNR, Vial ...#TAB#"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica, Universit\u00e0 di L\u2019Aquila, Via Vetoio, 67010 L\u2019Aquila, Italy and Istituto di Analisi\ndei Sistemi ed Informatica \u201cA. Ruberti\u201d, CNR, Viale Manzoni 30, 00185 Roma, Italy","institution_ids":["https://openalex.org/I4210162062"]},{"raw_affiliation_string":"Dipartimento di Informatica, Universit\u00e0 di L\u2019Aquila, Via Vetoio, 67010 L\u2019Aquila, Italy and Istituto di Analisi dei Sistemi ed Informatica \u201cA. Ruberti\u201d, CNR, Vial ...#TAB#","institution_ids":["https://openalex.org/I26415053"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109904634","display_name":"Peter Widmayer","orcid":null},"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":"Peter Widmayer","raw_affiliation_strings":["Institut f\u00fcr Theoretische Informatik, ETH Zentrum, CLWC 2, Clausiusstrasse 49, 8092 Z\u00fcrich, Switzerland","Institut f\u00fcr Theoretische Informatik, ETH Zentrum, CLWC 2, Clausiusstrasse 49, 8092 Z\u00fcrich, Switzerland#TAB#"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Theoretische Informatik, ETH Zentrum, CLWC 2, Clausiusstrasse 49, 8092 Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]},{"raw_affiliation_string":"Institut f\u00fcr Theoretische Informatik, ETH Zentrum, CLWC 2, Clausiusstrasse 49, 8092 Z\u00fcrich, Switzerland#TAB#","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5058595042"],"corresponding_institution_ids":["https://openalex.org/I4210162062"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.4957,"has_fulltext":true,"cited_by_count":18,"citation_normalized_percentile":{"value":0.86276732,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"40","issue":"2","first_page":"119","last_page":"132"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9991000294685364,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9991000294685364,"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/T11182","display_name":"Auction Theory and Applications","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9961000084877014,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/ackermann-function","display_name":"Ackermann function","score":0.8081010580062866},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.774337887763977},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6567182540893555},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.574792206287384},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5608021020889282},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5300105810165405},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4897472858428955},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.4546407461166382},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.4337650239467621},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4278918206691742},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41328752040863037},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4126877784729004},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.3876330852508545},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2667837142944336},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08773359656333923}],"concepts":[{"id":"https://openalex.org/C33436860","wikidata":"https://www.wikidata.org/wiki/Q341835","display_name":"Ackermann function","level":3,"score":0.8081010580062866},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.774337887763977},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6567182540893555},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.574792206287384},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5608021020889282},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5300105810165405},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4897472858428955},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.4546407461166382},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.4337650239467621},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4278918206691742},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41328752040863037},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4126877784729004},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.3876330852508545},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2667837142944336},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08773359656333923}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1007/s00453-004-1099-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-004-1099-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-004-1099-9.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:art.torvergata.it:2108/31836","is_oa":true,"landing_page_url":"http://hdl.handle.net/2108/31836","pdf_url":"http://hdl.handle.net/2108/31836","source":{"id":"https://openalex.org/S4306400993","display_name":"Cineca Institutional Research Information System (Tor Vergata University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I116067653","host_organization_name":"University of Rome Tor Vergata","host_organization_lineage":["https://openalex.org/I116067653"],"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":"info:eu-repo/semantics/article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.134.1489","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.134.1489","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mat.uniroma2.it/~nardelli/publications/Algorithmica-2004.pdf","raw_type":"text"},{"id":"pmh:oai:doc.rero.ch:313840","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400148","display_name":"reroDoc Digital Library","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:www.research-collection.ethz.ch:20.500.11850/49951","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.11850/49951","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica, 40 (2)","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"doi:10.3929/ethz-b-000049951","is_oa":true,"landing_page_url":"https://doi.org/10.3929/ethz-b-000049951","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.1007/s00453-004-1099-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-004-1099-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-004-1099-9.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.4099999964237213,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","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"},{"id":"https://openalex.org/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"},{"id":"https://openalex.org/F4320321873","display_name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","ror":"https://ror.org/0166hxq48"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2123839217.pdf","grobid_xml":"https://content.openalex.org/works/W2123839217.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W1501146038","https://openalex.org/W1571540404","https://openalex.org/W1841951257","https://openalex.org/W1978099551","https://openalex.org/W1978228527","https://openalex.org/W1980943820","https://openalex.org/W1982842799","https://openalex.org/W1986022261","https://openalex.org/W2012634103","https://openalex.org/W2015007620","https://openalex.org/W2023658462","https://openalex.org/W2032841680","https://openalex.org/W2038728802","https://openalex.org/W2065503744","https://openalex.org/W2075543862","https://openalex.org/W2076163262","https://openalex.org/W2078040677","https://openalex.org/W2078199146","https://openalex.org/W2160907067"],"related_works":["https://openalex.org/W2943635264","https://openalex.org/W2307044859","https://openalex.org/W4380840098","https://openalex.org/W2014991506","https://openalex.org/W2387385213","https://openalex.org/W3016811403","https://openalex.org/W2562218965","https://openalex.org/W4387560073","https://openalex.org/W2099915933","https://openalex.org/W88291963"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}