Publication Information

{'id': 'https://openalex.org/W2384589661', 'doi': None, 'title': 'An Update Strategy for Minimum Spanning Tree of Net', 'display_name': 'An Update Strategy for Minimum Spanning Tree of Net', 'publication_year': 2012, 'publication_date': '2012-01-01', 'ids': {'openalex': 'https://openalex.org/W2384589661', 'mag': '2384589661'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'http://en.cnki.com.cn/Article_en/CJFDTOTAL-JYXH201206035.htm', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S2765062833', 'display_name': 'Computer and Modernization', 'issn_l': None, 'issn': None, 'is_oa': False, 'is_in_doaj': False, 'is_core': False, 'host_organization': 'https://openalex.org/P4361727483', 'host_organization_name': 'Computer Science in Jiangxi Province', 'host_organization_lineage': ['https://openalex.org/P4361727483'], 'host_organization_lineage_names': ['Computer Science in Jiangxi Province'], 'type': 'journal'}, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}, 'type': 'article', 'type_crossref': 'journal-article', 'indexed_in': [], '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/A5102991710', 'display_name': 'Yuan Cheng', 'orcid': 'https://orcid.org/0009-0001-0462-7543'}, 'institutions': [{'id': 'https://openalex.org/I4210159152', 'display_name': 'Tongling University', 'ror': 'https://ror.org/04kqvjg13', 'country_code': 'CN', 'type': 'education', 'lineage': ['https://openalex.org/I4210159152']}], 'countries': ['CN'], 'is_corresponding': True, 'raw_author_name': 'Cheng Yuan', 'raw_affiliation_strings': ['Network Center,Tongling University,Tongling 244000,China)'], 'affiliations': [{'raw_affiliation_string': 'Network Center,Tongling University,Tongling 244000,China)', 'institution_ids': ['https://openalex.org/I4210159152']}]}], 'institution_assertions': [], 'countries_distinct_count': 1, 'institutions_distinct_count': 1, 'corresponding_author_ids': ['https://openalex.org/A5102991710'], 'corresponding_institution_ids': ['https://openalex.org/I4210159152'], 'apc_list': None, 'apc_paid': None, 'fwci': 0.0, 'has_fulltext': False, 'cited_by_count': 0, 'citation_normalized_percentile': {'value': 0.0, 'is_in_top_1_percent': False, 'is_in_top_10_percent': False}, 'cited_by_percentile_year': {'min': 0, 'max': 64}, 'biblio': {'volume': None, 'issue': None, 'first_page': None, 'last_page': None}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T11106', 'display_name': 'Data Management and Algorithms', 'score': 0.9901, 'subfield': {'id': 'https://openalex.org/subfields/1711', 'display_name': 'Signal Processing'}, '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/T11106', 'display_name': 'Data Management and Algorithms', 'score': 0.9901, 'subfield': {'id': 'https://openalex.org/subfields/1711', 'display_name': 'Signal Processing'}, '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/T10317', 'display_name': 'Advanced Database Systems and Queries', 'score': 0.9831, '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/T12292', 'display_name': 'Graph Theory and Algorithms', 'score': 0.9819, 'subfield': {'id': 'https://openalex.org/subfields/1707', 'display_name': 'Computer Vision and Pattern Recognition'}, '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.83030343}, {'id': 'https://openalex.org/keywords/prims-algorithm', 'display_name': "Prim's algorithm", 'score': 0.5669525}, {'id': 'https://openalex.org/keywords/k-minimum-spanning-tree', 'display_name': 'k-minimum spanning tree', 'score': 0.44572887}, {'id': 'https://openalex.org/keywords/gomory–hu-tree', 'display_name': 'Gomory–Hu tree', 'score': 0.4109996}], 'concepts': [{'id': 'https://openalex.org/C13743678', 'wikidata': 'https://www.wikidata.org/wiki/Q240464', 'display_name': 'Minimum spanning tree', 'level': 2, 'score': 0.89371574}, {'id': 'https://openalex.org/C63645285', 'wikidata': 'https://www.wikidata.org/wiki/Q797860', 'display_name': "Kruskal's algorithm", 'level': 3, 'score': 0.88744926}, {'id': 'https://openalex.org/C64331007', 'wikidata': 'https://www.wikidata.org/wiki/Q831672', 'display_name': 'Spanning tree', 'level': 2, 'score': 0.8342134}, {'id': 'https://openalex.org/C199346575', 'wikidata': 'https://www.wikidata.org/wiki/Q4925151', 'display_name': 'Reverse-delete algorithm', 'level': 4, 'score': 0.83030343}, {'id': 'https://openalex.org/C65949645', 'wikidata': 'https://www.wikidata.org/wiki/Q5283163', 'display_name': 'Distributed minimum spanning tree', 'level': 3, 'score': 0.8240208}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.7890047}, {'id': 'https://openalex.org/C145685049', 'wikidata': 'https://www.wikidata.org/wiki/Q4454941', 'display_name': 'Euclidean minimum spanning tree', 'level': 4, 'score': 0.6240009}, {'id': 'https://openalex.org/C1649724', 'wikidata': 'https://www.wikidata.org/wiki/Q470813', 'display_name': "Prim's algorithm", 'level': 4, 'score': 0.5669525}, {'id': 'https://openalex.org/C23394520', 'wikidata': 'https://www.wikidata.org/wiki/Q4919350', 'display_name': 'Shortest-path tree', 'level': 3, 'score': 0.5064794}, {'id': 'https://openalex.org/C132525143', 'wikidata': 'https://www.wikidata.org/wiki/Q141488', 'display_name': 'Graph', 'level': 2, 'score': 0.47462118}, {'id': 'https://openalex.org/C37810922', 'wikidata': 'https://www.wikidata.org/wiki/Q5161409', 'display_name': 'Connected dominating set', 'level': 3, 'score': 0.45879883}, {'id': 'https://openalex.org/C62611344', 'wikidata': 'https://www.wikidata.org/wiki/Q1062658', 'display_name': 'Node (physics)', 'level': 2, 'score': 0.4537282}, {'id': 'https://openalex.org/C202750272', 'wikidata': 'https://www.wikidata.org/wiki/Q6322849', 'display_name': 'k-minimum spanning tree', 'level': 5, 'score': 0.44572887}, {'id': 'https://openalex.org/C147517495', 'wikidata': 'https://www.wikidata.org/wiki/Q5581241', 'display_name': 'Gomory–Hu tree', 'level': 5, 'score': 0.4109996}, {'id': 'https://openalex.org/C126255220', 'wikidata': 'https://www.wikidata.org/wiki/Q141495', 'display_name': 'Mathematical optimization', 'level': 1, 'score': 0.35872462}, {'id': 'https://openalex.org/C80444323', 'wikidata': 'https://www.wikidata.org/wiki/Q2878974', 'display_name': 'Theoretical computer science', 'level': 1, 'score': 0.33632576}, {'id': 'https://openalex.org/C11413529', 'wikidata': 'https://www.wikidata.org/wiki/Q8366', 'display_name': 'Algorithm', 'level': 1, 'score': 0.30086836}, {'id': 'https://openalex.org/C100560664', 'wikidata': 'https://www.wikidata.org/wiki/Q3608019', 'display_name': 'K-ary tree', 'level': 4, 'score': 0.24486363}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.18202758}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.17490587}, {'id': 'https://openalex.org/C163797641', 'wikidata': 'https://www.wikidata.org/wiki/Q2067937', 'display_name': 'Tree structure', 'level': 3, 'score': 0.16181901}, {'id': 'https://openalex.org/C197855036', 'wikidata': 'https://www.wikidata.org/wiki/Q380172', 'display_name': 'Binary tree', 'level': 2, 'score': 0.08687362}, {'id': 'https://openalex.org/C66938386', 'wikidata': 'https://www.wikidata.org/wiki/Q633538', 'display_name': 'Structural engineering', 'level': 1, 'score': 0.0}, {'id': 'https://openalex.org/C127413603', 'wikidata': 'https://www.wikidata.org/wiki/Q11023', 'display_name': 'Engineering', 'level': 0, 'score': 0.0}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'http://en.cnki.com.cn/Article_en/CJFDTOTAL-JYXH201206035.htm', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S2765062833', 'display_name': 'Computer and Modernization', 'issn_l': None, 'issn': None, 'is_oa': False, 'is_in_doaj': False, 'is_core': False, 'host_organization': 'https://openalex.org/P4361727483', 'host_organization_name': 'Computer Science in Jiangxi Province', 'host_organization_lineage': ['https://openalex.org/P4361727483'], 'host_organization_lineage_names': ['Computer Science in Jiangxi Province'], 'type': 'journal'}, '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': 0, 'referenced_works': [], 'related_works': ['https://openalex.org/W2942013815', 'https://openalex.org/W2582147058', 'https://openalex.org/W2477124885', 'https://openalex.org/W2393054851', 'https://openalex.org/W2390742649', 'https://openalex.org/W2388143981', 'https://openalex.org/W2370313286', 'https://openalex.org/W2367883989', 'https://openalex.org/W2363076693', 'https://openalex.org/W2360537044', 'https://openalex.org/W2360161157', 'https://openalex.org/W2360026231', 'https://openalex.org/W2358819722', 'https://openalex.org/W2358746580', 'https://openalex.org/W2355706734', 'https://openalex.org/W2353822696', 'https://openalex.org/W2348150593', 'https://openalex.org/W2138987445', 'https://openalex.org/W1996532959', 'https://openalex.org/W1977899923'], 'abstract_inverted_index': {'Solving': [0], 'the': [1, 33, 37, 65, 70], 'problem': [2], 'of': [3, 18, 42], 'minimum': [4, 34, 43, 66], 'spanning': [5, 35, 44, 67], 'tree': [6, 45, 68], 'has': [7, 30], 'been': [8], 'widely': [9], 'used': [10], 'to': [11, 31], 'solve': [12], 'searching': [13], 'issues': [14], 'in': [15, 50], 'reality.However,the': [16], 'node': [17, 39], 'a': [19], 'connected': [20], 'graph': [21, 38, 71], 'net': [22], 'is': [23, 54], 'often': [24], 'changed,and,once': [25], "it's": [26], 'changed,the': [27], 'traditional': [28], 'algorithm': [29, 59], 'recalculate': [32], 'tree.But,even': [36], 'changes,not': [40], 'all': [41], 'will': [46], 'be': [47], 'changed,which': [48], 'results': [49], 'unnecessary': [51], 'waste.This': [52], 'article': [53], 'aimed': [55], 'at': [56], 'improving': [57], 'Kruskal': [58], 'and': [60], 'Prim': [61], 'algorithm,which': [62], 'can': [63], 'update': [64], 'when': [69], 'changes': [72], 'without': [73], 'recalculating.': [74]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W2384589661', 'counts_by_year': [], 'updated_date': '2024-12-12T05:35:25.965985', 'created_date': '2016-06-24'}