Publication Information

{'id': 'https://openalex.org/W2099915933', 'doi': 'https://doi.org/10.1007/978-1-4471-5173-9_6', 'title': 'Minimum Spanning Trees', 'display_name': 'Minimum Spanning Trees', 'publication_year': 2013, 'publication_date': '2013-01-01', 'ids': {'openalex': 'https://openalex.org/W2099915933', 'doi': 'https://doi.org/10.1007/978-1-4471-5173-9_6', 'mag': '2099915933'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://doi.org/10.1007/978-1-4471-5173-9_6', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S4210175725', 'display_name': 'Computer communications and networks', 'issn_l': '1617-7975', 'issn': ['1617-7975', '2197-8433'], 'is_oa': False, 'is_in_doaj': False, 'is_core': True, 'host_organization': None, 'host_organization_name': None, 'host_organization_lineage': [], 'host_organization_lineage_names': [], '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/A5021868439', 'display_name': 'K. Erciyes', 'orcid': 'https://orcid.org/0000-0001-9111-7156'}, 'institutions': [{'id': 'https://openalex.org/I132257509', 'display_name': 'Izmir University', 'ror': 'https://ror.org/013h3xr51', 'country_code': 'TR', 'type': 'education', 'lineage': ['https://openalex.org/I132257509']}], 'countries': ['TR'], 'is_corresponding': True, 'raw_author_name': 'K. Erciyes', 'raw_affiliation_strings': ['Izmir University#TAB#'], 'affiliations': [{'raw_affiliation_string': 'Izmir University#TAB#', 'institution_ids': ['https://openalex.org/I132257509']}]}], 'institution_assertions': [], 'countries_distinct_count': 1, 'institutions_distinct_count': 1, 'corresponding_author_ids': ['https://openalex.org/A5021868439'], 'corresponding_institution_ids': ['https://openalex.org/I132257509'], 'apc_list': None, 'apc_paid': None, 'fwci': 0.361, 'has_fulltext': False, 'cited_by_count': 3, 'citation_normalized_percentile': {'value': 0.595404, 'is_in_top_1_percent': False, 'is_in_top_10_percent': False}, 'cited_by_percentile_year': {'min': 76, 'max': 78}, 'biblio': {'volume': None, 'issue': None, 'first_page': '69', 'last_page': '82'}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T10720', 'display_name': 'Complexity and Algorithms in Graphs', 'score': 0.9998, '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/T10720', 'display_name': 'Complexity and Algorithms in Graphs', 'score': 0.9998, '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/T11478', 'display_name': 'Caching and Content Delivery', 'score': 0.9987, '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/T12288', 'display_name': 'Optimization and Search Problems', 'score': 0.9975, '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/reverse-delete-algorithm', 'display_name': 'Reverse-delete algorithm', 'score': 0.7188892}, {'id': 'https://openalex.org/keywords/prims-algorithm', 'display_name': "Prim's algorithm", 'score': 0.53517956}, {'id': 'https://openalex.org/keywords/k-minimum-spanning-tree', 'display_name': 'k-minimum spanning tree', 'score': 0.48276153}], 'concepts': [{'id': 'https://openalex.org/C64331007', 'wikidata': 'https://www.wikidata.org/wiki/Q831672', 'display_name': 'Spanning tree', 'level': 2, 'score': 0.9431079}, {'id': 'https://openalex.org/C13743678', 'wikidata': 'https://www.wikidata.org/wiki/Q240464', 'display_name': 'Minimum spanning tree', 'level': 2, 'score': 0.91718984}, {'id': 'https://openalex.org/C65949645', 'wikidata': 'https://www.wikidata.org/wiki/Q5283163', 'display_name': 'Distributed minimum spanning tree', 'level': 3, 'score': 0.8131361}, {'id': 'https://openalex.org/C199346575', 'wikidata': 'https://www.wikidata.org/wiki/Q4925151', 'display_name': 'Reverse-delete algorithm', 'level': 4, 'score': 0.7188892}, {'id': 'https://openalex.org/C63645285', 'wikidata': 'https://www.wikidata.org/wiki/Q797860', 'display_name': "Kruskal's algorithm", 'level': 3, 'score': 0.71822745}, {'id': 'https://openalex.org/C23394520', 'wikidata': 'https://www.wikidata.org/wiki/Q4919350', 'display_name': 'Shortest-path tree', 'level': 3, 'score': 0.6671324}, {'id': 'https://openalex.org/C64271015', 'wikidata': 'https://www.wikidata.org/wiki/Q6865444', 'display_name': 'Minimum degree spanning tree', 'level': 3, 'score': 0.6602682}, {'id': 'https://openalex.org/C37810922', 'wikidata': 'https://www.wikidata.org/wiki/Q5161409', 'display_name': 'Connected dominating set', 'level': 3, 'score': 0.5969789}, {'id': 'https://openalex.org/C1649724', 'wikidata': 'https://www.wikidata.org/wiki/Q470813', 'display_name': "Prim's algorithm", 'level': 4, 'score': 0.53517956}, {'id': 'https://openalex.org/C151319957', 'wikidata': 'https://www.wikidata.org/wiki/Q752739', 'display_name': 'Asynchronous communication', 'level': 2, 'score': 0.511993}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.5028805}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.4922935}, {'id': 'https://openalex.org/C202750272', 'wikidata': 'https://www.wikidata.org/wiki/Q6322849', 'display_name': 'k-minimum spanning tree', 'level': 5, 'score': 0.48276153}, {'id': 'https://openalex.org/C145685049', 'wikidata': 'https://www.wikidata.org/wiki/Q4454941', 'display_name': 'Euclidean minimum spanning tree', 'level': 4, 'score': 0.47306597}, {'id': 'https://openalex.org/C132525143', 'wikidata': 'https://www.wikidata.org/wiki/Q141488', 'display_name': 'Graph', 'level': 2, 'score': 0.41592157}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.40943247}, {'id': 'https://openalex.org/C100560664', 'wikidata': 'https://www.wikidata.org/wiki/Q3608019', 'display_name': 'K-ary tree', 'level': 4, 'score': 0.2621045}, {'id': 'https://openalex.org/C163797641', 'wikidata': 'https://www.wikidata.org/wiki/Q2067937', 'display_name': 'Tree structure', 'level': 3, 'score': 0.15363348}, {'id': 'https://openalex.org/C197855036', 'wikidata': 'https://www.wikidata.org/wiki/Q380172', 'display_name': 'Binary tree', 'level': 2, 'score': 0.09384754}, {'id': 'https://openalex.org/C31258907', 'wikidata': 'https://www.wikidata.org/wiki/Q1301371', 'display_name': 'Computer network', 'level': 1, 'score': 0.069155544}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'https://doi.org/10.1007/978-1-4471-5173-9_6', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S4210175725', 'display_name': 'Computer communications and networks', 'issn_l': '1617-7975', 'issn': ['1617-7975', '2197-8433'], 'is_oa': False, 'is_in_doaj': False, 'is_core': True, 'host_organization': None, 'host_organization_name': None, 'host_organization_lineage': [], 'host_organization_lineage_names': [], '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': 9, 'referenced_works': ['https://openalex.org/W1534484868', 'https://openalex.org/W1568961751', 'https://openalex.org/W2053788000', 'https://openalex.org/W2053981136', 'https://openalex.org/W2058191123', 'https://openalex.org/W2100466311', 'https://openalex.org/W2136604606', 'https://openalex.org/W2163097371', 'https://openalex.org/W4205300528'], 'related_works': ['https://openalex.org/W4380840098', 'https://openalex.org/W3081212354', 'https://openalex.org/W3016811403', 'https://openalex.org/W2943635264', 'https://openalex.org/W2589768050', 'https://openalex.org/W2418231958', 'https://openalex.org/W2390742649', 'https://openalex.org/W2387385213', 'https://openalex.org/W2281826919', 'https://openalex.org/W2059360098'], 'abstract_inverted_index': {'A': [0], 'minimum': [1, 15, 48], 'spanning': [2, 10, 25, 28, 49], 'tree': [3, 11], 'of': [4, 18, 22], 'a': [5, 14], 'weighted': [6], 'graph': [7], 'is': [8], 'its': [9], 'T': [12, 21], 'with': [13], 'total': [16], 'cost': [17], 'edges': [19], 'in': [20, 33], 'all': [23], 'possible': [24], 'trees.': [26, 50], 'Minimum': [27], 'trees': [29], 'have': [30], 'many': [31], 'applications': [32], 'computer': [34], 'networks.': [35], 'In': [36], 'this': [37], 'chapter,': [38], 'we': [39], 'investigate': [40], 'synchronous': [41], 'and': [42], 'asynchronous': [43], 'distributed': [44], 'algorithms': [45], 'to': [46], 'construct': [47]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W2099915933', 'counts_by_year': [{'year': 2020, 'cited_by_count': 1}, {'year': 2014, 'cited_by_count': 1}], 'updated_date': '2024-12-09T13:31:29.215229', 'created_date': '2016-06-24'}