{"id":"https://openalex.org/W2042125957","doi":"https://doi.org/10.1007/s00493-006-0014-1","title":"An Inverse-Ackermann Type Lower Bound For Online Minimum Spanning Tree Verification*","display_name":"An Inverse-Ackermann Type Lower Bound For Online Minimum Spanning Tree Verification*","publication_year":2006,"publication_date":"2006-04-01","ids":{"openalex":"https://openalex.org/W2042125957","doi":"https://doi.org/10.1007/s00493-006-0014-1","mag":"2042125957"},"language":"en","primary_location":{"id":"doi:10.1007/s00493-006-0014-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00493-006-0014-1","pdf_url":null,"source":{"id":"https://openalex.org/S72366220","display_name":"COMBINATORICA","issn_l":"0209-9683","issn":["0209-9683","1439-6912"],"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":"Combinatorica","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/A5076564426","display_name":"Seth Pettie","orcid":"https://orcid.org/0000-0002-0495-3904"},"institutions":[{"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\u2020","raw_affiliation_strings":["Max Planck Institut f\u00fcr Informatik, Stuhlsatzenhausweg 85, 66123, Saarbr\u00fccken, Germany","Max-Planck-Institut fur Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrucken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max Planck Institut f\u00fcr Informatik, Stuhlsatzenhausweg 85, 66123, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Max-Planck-Institut fur Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrucken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5076564426"],"corresponding_institution_ids":["https://openalex.org/I4210109712"],"apc_list":null,"apc_paid":null,"fwci":1.3867,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.84336214,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"26","issue":"2","first_page":"207","last_page":"230"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9986000061035156,"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.8840309381484985},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7571028470993042},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7546894550323486},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7008582353591919},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6977054476737976},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.6173445582389832},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.4870017170906067},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.4780876338481903},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4675288200378418},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.4621949791908264},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.45739516615867615},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45136287808418274},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43840712308883667},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.4323728084564209},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4198186695575714},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.41361337900161743},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.2297837734222412},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.14844229817390442}],"concepts":[{"id":"https://openalex.org/C33436860","wikidata":"https://www.wikidata.org/wiki/Q341835","display_name":"Ackermann function","level":3,"score":0.8840309381484985},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7571028470993042},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7546894550323486},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7008582353591919},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6977054476737976},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.6173445582389832},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.4870017170906067},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.4780876338481903},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4675288200378418},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.4621949791908264},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.45739516615867615},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45136287808418274},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43840712308883667},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.4323728084564209},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4198186695575714},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.41361337900161743},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2297837734222412},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.14844229817390442},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00493-006-0014-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00493-006-0014-1","pdf_url":null,"source":{"id":"https://openalex.org/S72366220","display_name":"COMBINATORICA","issn_l":"0209-9683","issn":["0209-9683","1439-6912"],"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":"Combinatorica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W4796843","https://openalex.org/W1495932320","https://openalex.org/W1521225740","https://openalex.org/W1567047166","https://openalex.org/W1598589216","https://openalex.org/W1965525854","https://openalex.org/W1969446695","https://openalex.org/W1969573308","https://openalex.org/W1978099551","https://openalex.org/W1979109797","https://openalex.org/W1984033909","https://openalex.org/W1986022261","https://openalex.org/W1986261983","https://openalex.org/W1999545213","https://openalex.org/W2011999472","https://openalex.org/W2016871180","https://openalex.org/W2023658462","https://openalex.org/W2030153860","https://openalex.org/W2032841680","https://openalex.org/W2039221685","https://openalex.org/W2047976119","https://openalex.org/W2055257826","https://openalex.org/W2065105907","https://openalex.org/W2069001533","https://openalex.org/W2075188242","https://openalex.org/W2089290774","https://openalex.org/W2089620427","https://openalex.org/W2124852572","https://openalex.org/W2134845011","https://openalex.org/W2137120608","https://openalex.org/W2138304862","https://openalex.org/W2152506249","https://openalex.org/W2160495255","https://openalex.org/W2752885492","https://openalex.org/W3145128584"],"related_works":["https://openalex.org/W1997570556","https://openalex.org/W620960161","https://openalex.org/W2408068853","https://openalex.org/W1510935138","https://openalex.org/W2071845176","https://openalex.org/W1754127855","https://openalex.org/W1576317141","https://openalex.org/W2039611868","https://openalex.org/W2117879716","https://openalex.org/W2911818503"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}