Get quick answers to your questions about the article from our AI researcher chatbot
{'id': 'https://openalex.org/W1491195793', 'doi': 'https://doi.org/10.1007/978-3-642-11409-0_16', 'title': 'An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees', 'display_name': 'An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees', 'publication_year': 2009, 'publication_date': '2009-12-03', 'ids': {'openalex': 'https://openalex.org/W1491195793', 'doi': 'https://doi.org/10.1007/978-3-642-11409-0_16', 'mag': '1491195793'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://doi.org/10.1007/978-3-642-11409-0_16', 'pdf_url': None, '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/P4310319965', 'https://openalex.org/P4310319900'], 'host_organization_lineage_names': ['Springer Nature', 'Springer Science+Business Media'], 'type': 'book series'}, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}, 'type': 'book-chapter', 'type_crossref': 'book-chapter', 'indexed_in': ['crossref'], 'open_access': {'is_oa': False, 'oa_status': 'closed', 'oa_url': None, 'any_repository_has_fulltext': False}, 'authorships': [{'author_position': 'first', 'author': {'id': 'https://openalex.org/A5059236728', 'display_name': 'Torben Hagerup', 'orcid': 'https://orcid.org/0000-0001-6974-2473'}, 'institutions': [{'id': 'https://openalex.org/I179225836', 'display_name': 'University of Augsburg', 'ror': 'https://ror.org/03p14d497', 'country_code': 'DE', 'type': 'education', 'lineage': ['https://openalex.org/I179225836']}], 'countries': ['DE'], 'is_corresponding': True, 'raw_author_name': 'Torben Hagerup', 'raw_affiliation_strings': ['Institut für Informatik, Universität Augsburg, 86135, Augsburg, Germany'], 'affiliations': [{'raw_affiliation_string': 'Institut für Informatik, Universität Augsburg, 86135, Augsburg, Germany', 'institution_ids': ['https://openalex.org/I179225836']}]}], 'institution_assertions': [], 'countries_distinct_count': 1, 'institutions_distinct_count': 1, 'corresponding_author_ids': ['https://openalex.org/A5059236728'], 'corresponding_institution_ids': ['https://openalex.org/I179225836'], 'apc_list': {'value': 5000, 'currency': 'EUR', 'value_usd': 5392, 'provenance': 'doaj'}, 'apc_paid': None, 'fwci': 0.0, 'has_fulltext': True, 'fulltext_origin': 'ngrams', 'cited_by_count': 8, 'citation_normalized_percentile': {'value': 0.679825, 'is_in_top_1_percent': False, 'is_in_top_10_percent': False}, 'cited_by_percentile_year': {'min': 82, 'max': 83}, 'biblio': {'volume': None, 'issue': None, 'first_page': '178', 'last_page': '189'}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T10142', 'display_name': 'Formal Methods in Verification', 'score': 0.9993, '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'}}, 'topics': [{'id': 'https://openalex.org/T10142', 'display_name': 'Formal Methods in Verification', 'score': 0.9993, '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'}}, {'id': 'https://openalex.org/T11522', 'display_name': 'VLSI and FPGA Design Techniques', 'score': 0.9989, '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.9966, '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'}}], 'keywords': [{'id': 'https://openalex.org/keywords/prims-algorithm', 'display_name': "Prim's algorithm", 'score': 0.66590637}, {'id': 'https://openalex.org/keywords/reverse-delete-algorithm', 'display_name': 'Reverse-delete algorithm', 'score': 0.6434269}, {'id': 'https://openalex.org/keywords/tree', 'display_name': 'Tree (set theory)', 'score': 0.5465474}, {'id': 'https://openalex.org/keywords/maxima', 'display_name': 'Maxima', 'score': 0.50152445}, {'id': 'https://openalex.org/keywords/minimum-weight', 'display_name': 'Minimum weight', 'score': 0.43779135}, {'id': 'https://openalex.org/keywords/k-minimum-spanning-tree', 'display_name': 'k-minimum spanning tree', 'score': 0.43636426}], 'concepts': [{'id': 'https://openalex.org/C64331007', 'wikidata': 'https://www.wikidata.org/wiki/Q831672', 'display_name': 'Spanning tree', 'level': 2, 'score': 0.7493315}, {'id': 'https://openalex.org/C13743678', 'wikidata': 'https://www.wikidata.org/wiki/Q240464', 'display_name': 'Minimum spanning tree', 'level': 2, 'score': 0.73626804}, {'id': 'https://openalex.org/C1649724', 'wikidata': 'https://www.wikidata.org/wiki/Q470813', 'display_name': "Prim's algorithm", 'level': 4, 'score': 0.66590637}, {'id': 'https://openalex.org/C199346575', 'wikidata': 'https://www.wikidata.org/wiki/Q4925151', 'display_name': 'Reverse-delete algorithm', 'level': 4, 'score': 0.6434269}, {'id': 'https://openalex.org/C2777735758', 'wikidata': 'https://www.wikidata.org/wiki/Q817765', 'display_name': 'Path (computing)', 'level': 2, 'score': 0.62791246}, {'id': 'https://openalex.org/C65949645', 'wikidata': 'https://www.wikidata.org/wiki/Q5283163', 'display_name': 'Distributed minimum spanning tree', 'level': 3, 'score': 0.595886}, {'id': 'https://openalex.org/C311688', 'wikidata': 'https://www.wikidata.org/wiki/Q2393193', 'display_name': 'Time complexity', 'level': 2, 'score': 0.58857137}, {'id': 'https://openalex.org/C113174947', 'wikidata': 'https://www.wikidata.org/wiki/Q2859736', 'display_name': 'Tree (set theory)', 'level': 2, 'score': 0.5465474}, {'id': 'https://openalex.org/C63645285', 'wikidata': 'https://www.wikidata.org/wiki/Q797860', 'display_name': "Kruskal's algorithm", 'level': 3, 'score': 0.5259614}, {'id': 'https://openalex.org/C23394520', 'wikidata': 'https://www.wikidata.org/wiki/Q4919350', 'display_name': 'Shortest-path tree', 'level': 3, 'score': 0.50716186}, {'id': 'https://openalex.org/C11413529', 'wikidata': 'https://www.wikidata.org/wiki/Q8366', 'display_name': 'Algorithm', 'level': 1, 'score': 0.50542307}, {'id': 'https://openalex.org/C91528185', 'wikidata': 'https://www.wikidata.org/wiki/Q520952', 'display_name': 'Maxima', 'level': 3, 'score': 0.50152445}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.48183337}, {'id': 'https://openalex.org/C162307627', 'wikidata': 'https://www.wikidata.org/wiki/Q204833', 'display_name': 'Enhanced Data Rates for GSM Evolution', 'level': 2, 'score': 0.46969223}, {'id': 'https://openalex.org/C132525143', 'wikidata': 'https://www.wikidata.org/wiki/Q141488', 'display_name': 'Graph', 'level': 2, 'score': 0.4646992}, {'id': 'https://openalex.org/C2778945305', 'wikidata': 'https://www.wikidata.org/wiki/Q6865502', 'display_name': 'Minimum weight', 'level': 2, 'score': 0.43779135}, {'id': 'https://openalex.org/C202750272', 'wikidata': 'https://www.wikidata.org/wiki/Q6322849', 'display_name': 'k-minimum spanning tree', 'level': 5, 'score': 0.43636426}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.42389584}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.41654795}, {'id': 'https://openalex.org/C100560664', 'wikidata': 'https://www.wikidata.org/wiki/Q3608019', 'display_name': 'K-ary tree', 'level': 4, 'score': 0.40772578}, {'id': 'https://openalex.org/C163797641', 'wikidata': 'https://www.wikidata.org/wiki/Q2067937', 'display_name': 'Tree structure', 'level': 3, 'score': 0.30459854}, {'id': 'https://openalex.org/C197855036', 'wikidata': 'https://www.wikidata.org/wiki/Q380172', 'display_name': 'Binary tree', 'level': 2, 'score': 0.20117825}, {'id': 'https://openalex.org/C154945302', 'wikidata': 'https://www.wikidata.org/wiki/Q11660', 'display_name': 'Artificial intelligence', 'level': 1, 'score': 0.060869575}, {'id': 'https://openalex.org/C142362112', 'wikidata': 'https://www.wikidata.org/wiki/Q735', 'display_name': 'Art', 'level': 0, 'score': 0.0}, {'id': 'https://openalex.org/C554144382', 'wikidata': 'https://www.wikidata.org/wiki/Q213156', 'display_name': 'Performance art', 'level': 2, 'score': 0.0}, {'id': 'https://openalex.org/C52119013', 'wikidata': 'https://www.wikidata.org/wiki/Q50637', 'display_name': 'Art history', 'level': 1, 'score': 0.0}, {'id': 'https://openalex.org/C199360897', 'wikidata': 'https://www.wikidata.org/wiki/Q9143', 'display_name': 'Programming language', 'level': 1, 'score': 0.0}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'https://doi.org/10.1007/978-3-642-11409-0_16', 'pdf_url': None, '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/P4310319965', 'https://openalex.org/P4310319900'], 'host_organization_lineage_names': ['Springer Nature', 'Springer Science+Business Media'], 'type': 'book series'}, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}], 'best_oa_location': None, 'sustainable_development_goals': [], 'grants': [], 'datasets': [], 'versions': [], 'referenced_works_count': 21, 'referenced_works': ['https://openalex.org/W1827234103', 'https://openalex.org/W1887769558', 'https://openalex.org/W1965525854', 'https://openalex.org/W1969446695', 'https://openalex.org/W1977545325', 'https://openalex.org/W1978099551', 'https://openalex.org/W1981755382', 'https://openalex.org/W1992273661', 'https://openalex.org/W2014665344', 'https://openalex.org/W2023658462', 'https://openalex.org/W2032841680', 'https://openalex.org/W2042125957', 'https://openalex.org/W2057839002', 'https://openalex.org/W2069001533', 'https://openalex.org/W2087216833', 'https://openalex.org/W2089290774', 'https://openalex.org/W2109089989', 'https://openalex.org/W2134845011', 'https://openalex.org/W2138304862', 'https://openalex.org/W2152506249', 'https://openalex.org/W2164485560'], 'related_works': ['https://openalex.org/W4380840098', 'https://openalex.org/W3016811403', 'https://openalex.org/W2943635264', 'https://openalex.org/W2589768050', 'https://openalex.org/W2518240130', 'https://openalex.org/W2418231958', 'https://openalex.org/W2390742649', 'https://openalex.org/W2387385213', 'https://openalex.org/W2099915933', 'https://openalex.org/W2043113141'], 'abstract_inverted_index': None, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W1491195793', 'counts_by_year': [{'year': 2021, 'cited_by_count': 3}, {'year': 2016, 'cited_by_count': 1}, {'year': 2014, 'cited_by_count': 2}, {'year': 2013, 'cited_by_count': 2}], 'updated_date': '2024-12-16T20:45:23.500806', 'created_date': '2016-06-24'}