{"id":"https://openalex.org/W59523525","doi":"https://doi.org/10.1007/978-3-319-12340-0_14","title":"Minimum Spanning Tree Verification Under Uncertainty","display_name":"Minimum Spanning Tree Verification Under Uncertainty","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W59523525","doi":"https://doi.org/10.1007/978-3-319-12340-0_14","mag":"59523525"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-12340-0_14","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-12340-0_14","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":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://figshare.com/articles/conference_contribution/Minimum_Spanning_Tree_Verification_under_Uncertainty/10158413","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049579750","display_name":"Thomas Erlebach","orcid":"https://orcid.org/0000-0002-4470-5868"},"institutions":[{"id":"https://openalex.org/I153648349","display_name":"University of Leicester","ror":"https://ror.org/04h699437","country_code":"GB","type":"education","lineage":["https://openalex.org/I153648349"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Thomas Erlebach","raw_affiliation_strings":["Department of Computer Science, University of Leicester, Leicester, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Leicester, Leicester, UK","institution_ids":["https://openalex.org/I153648349"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060834678","display_name":"Michael Hoffmann","orcid":"https://orcid.org/0000-0001-8261-3983"},"institutions":[{"id":"https://openalex.org/I153648349","display_name":"University of Leicester","ror":"https://ror.org/04h699437","country_code":"GB","type":"education","lineage":["https://openalex.org/I153648349"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Michael Hoffmann","raw_affiliation_strings":["Department of Computer Science, University of Leicester, Leicester, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Leicester, Leicester, UK","institution_ids":["https://openalex.org/I153648349"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I153648349"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":4.006,"has_fulltext":true,"cited_by_count":13,"citation_normalized_percentile":{"value":0.9220294,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"164","last_page":"175"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9998000264167786,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9998000264167786,"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/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9988999962806702,"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/T10363","display_name":"Low-power high-performance VLSI design","score":0.9986000061035156,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6680202484130859},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6478677988052368},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.600472092628479},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5919867753982544},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5866084098815918},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5029370188713074},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4927556812763214},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4745757579803467},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.4656639099121094},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.4494946002960205},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4428120255470276},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.4422398507595062},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4400749206542969},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37561655044555664},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.33036887645721436}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6680202484130859},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6478677988052368},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.600472092628479},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5919867753982544},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5866084098815918},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5029370188713074},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4927556812763214},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4745757579803467},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.4656639099121094},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.4494946002960205},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4428120255470276},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.4422398507595062},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4400749206542969},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37561655044555664},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.33036887645721436},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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":4,"locations":[{"id":"doi:10.1007/978-3-319-12340-0_14","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-12340-0_14","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":"pmh:oai:figshare.com:article/10158413","is_oa":true,"landing_page_url":"https://figshare.com/articles/conference_contribution/Minimum_Spanning_Tree_Verification_under_Uncertainty/10158413","pdf_url":"https://figshare.com/articles/conference_contribution/Minimum_Spanning_Tree_Verification_under_Uncertainty/10158413","source":{"id":"https://openalex.org/S4306402621","display_name":"INDIGO (University of Illinois at Chicago)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39422238","host_organization_name":"University of Illinois Chicago","host_organization_lineage":["https://openalex.org/I39422238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference contribution"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.724.3290","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.724.3290","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.le.ac.uk/people/terlebach/papers/wg2014.pdf","raw_type":"text"},{"id":"pmh:oai:lra.le.ac.uk:2381/31666","is_oa":false,"landing_page_url":"http://hdl.handle.net/2381/31666","pdf_url":null,"source":{"id":"https://openalex.org/S4306402365","display_name":"Leicester Research Archive (University of Leicester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I153648349","host_organization_name":"University of Leicester","host_organization_lineage":["https://openalex.org/I153648349"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Paper"}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/10158413","is_oa":true,"landing_page_url":"https://figshare.com/articles/conference_contribution/Minimum_Spanning_Tree_Verification_under_Uncertainty/10158413","pdf_url":"https://figshare.com/articles/conference_contribution/Minimum_Spanning_Tree_Verification_under_Uncertainty/10158413","source":{"id":"https://openalex.org/S4306402621","display_name":"INDIGO (University of Illinois at Chicago)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39422238","host_organization_name":"University of Illinois Chicago","host_organization_lineage":["https://openalex.org/I39422238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference contribution"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W59523525.pdf","grobid_xml":"https://content.openalex.org/works/W59523525.grobid-xml"},"referenced_works_count":8,"referenced_works":["https://openalex.org/W1535323908","https://openalex.org/W1966156872","https://openalex.org/W2020112047","https://openalex.org/W2036686829","https://openalex.org/W2041077764","https://openalex.org/W2043675696","https://openalex.org/W2089939399","https://openalex.org/W2157615354"],"related_works":["https://openalex.org/W2036594069","https://openalex.org/W4244658307","https://openalex.org/W2156896570","https://openalex.org/W2949255922","https://openalex.org/W2099915933","https://openalex.org/W2038655901","https://openalex.org/W2418231958","https://openalex.org/W1627181101","https://openalex.org/W2043560626","https://openalex.org/W4380840098"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}