{"id":"https://openalex.org/W1533473794","doi":"https://doi.org/10.1007/11602613_96","title":"Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time","display_name":"Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W1533473794","doi":"https://doi.org/10.1007/11602613_96","mag":"1533473794"},"language":"en","primary_location":{"id":"doi:10.1007/11602613_96","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11602613_96","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.7155/jgaa.00365","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103188608","display_name":"Seth Pettie","orcid":"https://orcid.org/0000-0002-2610-1630"},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I149899117"]},{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Seth Pettie","raw_affiliation_strings":["Max Planck Institut f\u00fcr Informatik,","Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max Planck Institut f\u00fcr Informatik,","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103188608"],"corresponding_institution_ids":["https://openalex.org/I149899117","https://openalex.org/I4210109712"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"19","issue":"1","first_page":"375","last_page":"391"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9882000088691711,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9882000088691711,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T11476","display_name":"Graph theory and applications","score":0.9532999992370605,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9517999887466431,"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/ackermann-function","display_name":"Ackermann function","score":0.964805006980896},{"id":"https://openalex.org/keywords/sensitivity","display_name":"Sensitivity (control systems)","score":0.6491095423698425},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5909656882286072},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.5902776122093201},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.500213623046875},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4338854253292084},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.41296449303627014},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.10862863063812256},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08419337868690491}],"concepts":[{"id":"https://openalex.org/C33436860","wikidata":"https://www.wikidata.org/wiki/Q341835","display_name":"Ackermann function","level":3,"score":0.964805006980896},{"id":"https://openalex.org/C21200559","wikidata":"https://www.wikidata.org/wiki/Q7451068","display_name":"Sensitivity (control systems)","level":2,"score":0.6491095423698425},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5909656882286072},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.5902776122093201},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.500213623046875},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4338854253292084},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.41296449303627014},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.10862863063812256},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08419337868690491},{"id":"https://openalex.org/C24326235","wikidata":"https://www.wikidata.org/wiki/Q126095","display_name":"Electronic engineering","level":1,"score":0.0}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1007/11602613_96","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11602613_96","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"doi:10.7155/jgaa.00365","is_oa":true,"landing_page_url":"https://doi.org/10.7155/jgaa.00365","pdf_url":null,"source":{"id":"https://openalex.org/S33451491","display_name":"Journal of Graph Algorithms and Applications","issn_l":"1526-1719","issn":["1526-1719"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Algorithms and Applications","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1407.1910","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1407.1910","pdf_url":"https://arxiv.org/pdf/1407.1910","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":"mag:2950157671","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1407.1910","pdf_url":null,"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":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:edoc.mpg.de:279137","is_oa":false,"landing_page_url":"http://edoc.mpg.de/279137","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","issn_l":null,"issn":null,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms and computation : 16th International Symposium, ISAAC 2005, Springer, 964-973 (2005)","raw_type":"Conference-Paper"},{"id":"pmh:oai:pure.mpg.de:item_1329072","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-000F-27A7-B","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"doi:10.48550/arxiv.1407.1910","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1407.1910","pdf_url":null,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"},{"id":"mag:1533473794","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"doi:10.7155/jgaa.00365","is_oa":true,"landing_page_url":"https://doi.org/10.7155/jgaa.00365","pdf_url":null,"source":{"id":"https://openalex.org/S33451491","display_name":"Journal of Graph Algorithms and Applications","issn_l":"1526-1719","issn":["1526-1719"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Algorithms and Applications","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Climate action","id":"https://metadata.un.org/sdg/13","score":0.4699999988079071}],"awards":[{"id":"https://openalex.org/G3198296171","display_name":"AF:Small:Data Structures for Dynamic Networks","funder_award_id":"1217338","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5525452677","display_name":null,"funder_award_id":"CNS-1318294","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7974033425","display_name":null,"funder_award_id":"CCF-1217338","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8021246916","display_name":"TWC: Small: Collaborative: Cost-Competitve Analysis - A New Tool for Designing Secure Systems","funder_award_id":"1318294","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":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1567047166","https://openalex.org/W1598589216","https://openalex.org/W1887769558","https://openalex.org/W1969573308","https://openalex.org/W1978099551","https://openalex.org/W1979109797","https://openalex.org/W1982842799","https://openalex.org/W1986261983","https://openalex.org/W2028503265","https://openalex.org/W2030153860","https://openalex.org/W2042125957","https://openalex.org/W2048500523","https://openalex.org/W2065105907","https://openalex.org/W2069001533","https://openalex.org/W2087216833","https://openalex.org/W2089290774","https://openalex.org/W2089620427","https://openalex.org/W2103361121","https://openalex.org/W2124852572","https://openalex.org/W2137120608","https://openalex.org/W2152506249"],"related_works":["https://openalex.org/W175915039","https://openalex.org/W1973942323","https://openalex.org/W2577474424","https://openalex.org/W34362313","https://openalex.org/W2364797726","https://openalex.org/W2141551788","https://openalex.org/W2053783303","https://openalex.org/W2796034895","https://openalex.org/W2349211578","https://openalex.org/W2588664192","https://openalex.org/W172707356","https://openalex.org/W2355225748","https://openalex.org/W2270401140","https://openalex.org/W3191415409","https://openalex.org/W3109394793","https://openalex.org/W1543270570","https://openalex.org/W3094154456","https://openalex.org/W2951308702","https://openalex.org/W2078178103","https://openalex.org/W2362509356"],"abstract_inverted_index":{"We":[0,83],"present":[1],"a":[2,10,31,52,86],"deterministic":[3],"algorithm":[4,74,103],"for":[5],"computing":[6],"the":[7,25,76,92,98],"sensitivity":[8,90,116],"of":[9,35,54,56,104],"minimum":[11],"spanning":[12],"tree":[13,18],"(MST)":[14],"or":[15],"shortest":[16],"path":[17],"in":[19],"O(mlog\u03b1(m,n))":[20],"time,":[21],"where":[22],"\u03b1":[23],"is":[24,75],"inverse-Ackermann":[26],"function.":[27],"This":[28],"improves":[29],"upon":[30],"long":[32],"standing":[33],"bound":[34],"O(m\u03b1(m,n))":[36],"established":[37],"by":[38],"Tarjan.":[39],"Our":[40],"algorithms":[41],"are":[42,70],"based":[43],"on":[44],"an":[45],"efficient":[46],"split-findmin":[47,73],"data":[48],"structure,":[49],"which":[50],"maintains":[51],"collection":[53],"sequences":[55],"weighted":[57],"elements":[58],"that":[59],"may":[60],"be":[61],"split":[62],"into":[63],"smaller":[64],"subsequences.":[65],"As":[66],"far":[67],"as":[68],"we":[69],"aware,":[71],"our":[72],"first":[77],"with":[78,97],"superlinear":[79],"but":[80],"sub-inverse-Ackermann":[81],"complexity.":[82],"also":[84],"give":[85],"reduction":[87],"from":[88],"MST":[89,93,102,115],"to":[91],"problem":[94],"itself.":[95],"Together":[96],"randomized":[99,112],"linear":[100,113],"time":[101,114],"Karger,":[105],"Klein,":[106],"and":[107],"Tarjan,":[108],"this":[109],"gives":[110],"another":[111],"algorithm.":[117]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}