Publication Information

{'id': 'https://openalex.org/W2353822696', 'doi': None, 'title': 'A New Method for Obtaining Minimum Spanning Tree', 'display_name': 'A New Method for Obtaining Minimum Spanning Tree', 'publication_year': 2013, 'publication_date': '2013-01-01', 'ids': {'openalex': 'https://openalex.org/W2353822696', 'mag': '2353822696'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'http://en.cnki.com.cn/Article_en/CJFDTotal-SHZN201302027.htm', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S2764967712', 'display_name': 'Journal of Shihezi University', 'issn_l': None, 'issn': None, 'is_oa': False, 'is_in_doaj': False, 'is_core': False, 'host_organization': 'https://openalex.org/P4361729678', 'host_organization_name': 'Shihezi University', 'host_organization_lineage': ['https://openalex.org/P4361729678'], 'host_organization_lineage_names': ['Shihezi University'], '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/A5000788702', 'display_name': 'Hong Yan-jun', 'orcid': 'https://orcid.org/0000-0001-6630-5024'}, 'institutions': [{'id': 'https://openalex.org/I102208913', 'display_name': 'Shihezi University', 'ror': 'https://ror.org/04x0kvm78', 'country_code': 'CN', 'type': 'education', 'lineage': ['https://openalex.org/I102208913']}], 'countries': ['CN'], 'is_corresponding': True, 'raw_author_name': 'Hong Yanjun', 'raw_affiliation_strings': ['Normal college,Shihezi University,Shihezi 832003,China)'], 'affiliations': [{'raw_affiliation_string': 'Normal college,Shihezi University,Shihezi 832003,China)', 'institution_ids': ['https://openalex.org/I102208913']}]}], 'institution_assertions': [], 'countries_distinct_count': 1, 'institutions_distinct_count': 1, 'corresponding_author_ids': ['https://openalex.org/A5000788702'], 'corresponding_institution_ids': ['https://openalex.org/I102208913'], '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': 65}, 'biblio': {'volume': None, 'issue': None, 'first_page': None, 'last_page': None}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T12601', 'display_name': 'Web Applications and Data Management', 'score': 0.9695, 'subfield': {'id': 'https://openalex.org/subfields/1710', 'display_name': 'Information Systems'}, '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/T12601', 'display_name': 'Web Applications and Data Management', 'score': 0.9695, 'subfield': {'id': 'https://openalex.org/subfields/1710', 'display_name': 'Information Systems'}, '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/T10138', 'display_name': 'Network Traffic and Congestion Control', 'score': 0.9307, '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/k-minimum-spanning-tree', 'display_name': 'k-minimum spanning tree', 'score': 0.6637811}, {'id': 'https://openalex.org/keywords/reverse-delete-algorithm', 'display_name': 'Reverse-delete algorithm', 'score': 0.6272375}, {'id': 'https://openalex.org/keywords/prims-algorithm', 'display_name': "Prim's algorithm", 'score': 0.576178}, {'id': 'https://openalex.org/keywords/tree', 'display_name': 'Tree (set theory)', 'score': 0.5034508}, {'id': 'https://openalex.org/keywords/gomory–hu-tree', 'display_name': 'Gomory–Hu tree', 'score': 0.43776834}], 'concepts': [{'id': 'https://openalex.org/C13743678', 'wikidata': 'https://www.wikidata.org/wiki/Q240464', 'display_name': 'Minimum spanning tree', 'level': 2, 'score': 0.8889073}, {'id': 'https://openalex.org/C64331007', 'wikidata': 'https://www.wikidata.org/wiki/Q831672', 'display_name': 'Spanning tree', 'level': 2, 'score': 0.8636169}, {'id': 'https://openalex.org/C65949645', 'wikidata': 'https://www.wikidata.org/wiki/Q5283163', 'display_name': 'Distributed minimum spanning tree', 'level': 3, 'score': 0.84443945}, {'id': 'https://openalex.org/C145685049', 'wikidata': 'https://www.wikidata.org/wiki/Q4454941', 'display_name': 'Euclidean minimum spanning tree', 'level': 4, 'score': 0.70686215}, {'id': 'https://openalex.org/C202750272', 'wikidata': 'https://www.wikidata.org/wiki/Q6322849', 'display_name': 'k-minimum spanning tree', 'level': 5, 'score': 0.6637811}, {'id': 'https://openalex.org/C199346575', 'wikidata': 'https://www.wikidata.org/wiki/Q4925151', 'display_name': 'Reverse-delete algorithm', 'level': 4, 'score': 0.6272375}, {'id': 'https://openalex.org/C63645285', 'wikidata': 'https://www.wikidata.org/wiki/Q797860', 'display_name': "Kruskal's algorithm", 'level': 3, 'score': 0.59865135}, {'id': 'https://openalex.org/C1649724', 'wikidata': 'https://www.wikidata.org/wiki/Q470813', 'display_name': "Prim's algorithm", 'level': 4, 'score': 0.576178}, {'id': 'https://openalex.org/C162307627', 'wikidata': 'https://www.wikidata.org/wiki/Q204833', 'display_name': 'Enhanced Data Rates for GSM Evolution', 'level': 2, 'score': 0.51208425}, {'id': 'https://openalex.org/C113174947', 'wikidata': 'https://www.wikidata.org/wiki/Q2859736', 'display_name': 'Tree (set theory)', 'level': 2, 'score': 0.5034508}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.47308785}, {'id': 'https://openalex.org/C159694833', 'wikidata': 'https://www.wikidata.org/wiki/Q2321565', 'display_name': 'Iterative method', 'level': 2, 'score': 0.44410726}, {'id': 'https://openalex.org/C126255220', 'wikidata': 'https://www.wikidata.org/wiki/Q141495', 'display_name': 'Mathematical optimization', 'level': 1, 'score': 0.43961978}, {'id': 'https://openalex.org/C147517495', 'wikidata': 'https://www.wikidata.org/wiki/Q5581241', 'display_name': 'Gomory–Hu tree', 'level': 5, 'score': 0.43776834}, {'id': 'https://openalex.org/C132525143', 'wikidata': 'https://www.wikidata.org/wiki/Q141488', 'display_name': 'Graph', 'level': 2, 'score': 0.43432587}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.40999663}, {'id': 'https://openalex.org/C11413529', 'wikidata': 'https://www.wikidata.org/wiki/Q8366', 'display_name': 'Algorithm', 'level': 1, 'score': 0.40009865}, {'id': 'https://openalex.org/C163797641', 'wikidata': 'https://www.wikidata.org/wiki/Q2067937', 'display_name': 'Tree structure', 'level': 3, 'score': 0.27881485}, {'id': 'https://openalex.org/C100560664', 'wikidata': 'https://www.wikidata.org/wiki/Q3608019', 'display_name': 'K-ary tree', 'level': 4, 'score': 0.24844176}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.21728125}, {'id': 'https://openalex.org/C80444323', 'wikidata': 'https://www.wikidata.org/wiki/Q2878974', 'display_name': 'Theoretical computer science', 'level': 1, 'score': 0.21669468}, {'id': 'https://openalex.org/C154945302', 'wikidata': 'https://www.wikidata.org/wiki/Q11660', 'display_name': 'Artificial intelligence', 'level': 1, 'score': 0.109484285}, {'id': 'https://openalex.org/C197855036', 'wikidata': 'https://www.wikidata.org/wiki/Q380172', 'display_name': 'Binary tree', 'level': 2, 'score': 0.07832003}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'http://en.cnki.com.cn/Article_en/CJFDTotal-SHZN201302027.htm', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S2764967712', 'display_name': 'Journal of Shihezi University', 'issn_l': None, 'issn': None, 'is_oa': False, 'is_in_doaj': False, 'is_core': False, 'host_organization': 'https://openalex.org/P4361729678', 'host_organization_name': 'Shihezi University', 'host_organization_lineage': ['https://openalex.org/P4361729678'], 'host_organization_lineage_names': ['Shihezi University'], '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/W3007799401', 'https://openalex.org/W2477124885', 'https://openalex.org/W2391455976', 'https://openalex.org/W2371157450', 'https://openalex.org/W2367883989', 'https://openalex.org/W2363076693', 'https://openalex.org/W2360537044', 'https://openalex.org/W2360161157', 'https://openalex.org/W2360026231', 'https://openalex.org/W2358746580', 'https://openalex.org/W2355706734', 'https://openalex.org/W2349955314', 'https://openalex.org/W2348255823', 'https://openalex.org/W2163841430', 'https://openalex.org/W2095166134', 'https://openalex.org/W2055747731', 'https://openalex.org/W1978099551', 'https://openalex.org/W1977899923', 'https://openalex.org/W1971456873', 'https://openalex.org/W1948148225'], 'abstract_inverted_index': {'Minimum': [0], 'spanning': [1, 28, 63], 'tree': [2, 50, 60], 'and': [3, 49], 'its': [4], 'algorithm': [5, 19], 'is': [6, 20], 'one': [7, 37], 'of': [8, 15, 46, 72], 'the': [9, 13, 21, 31, 58, 70], 'important': [10, 67], 'subjects': [11], 'in': [12, 44, 69], 'study': [14], 'graph': [16], 'theory.The': [17], 'iterative': [18, 42], 'basic': [22], 'method': [23, 55, 65], 'for': [24], 'network': [25], 'optimization.For': [26], 'any': [27], 'tree,if': [29], 'not': [30], 'maximum,we': [32], 'can': [33], 'get': [34], 'a': [35, 53, 62], 'smaller': [36], 'by': [38], 'iteration': [39], 'rule.We': [40], 'introduce': [41], 'methods': [43], 'terms': [45], 'nontree': [47], 'edge': [48], 'edge,and': [51], 'offer': [52], 'new': [54], 'to': [56], 'find': [57], 'minimum': [59], 'from': [61], 'tree.The': [64], 'has': [66], 'application': [68], 'design': [71], 'network.': [73]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W2353822696', 'counts_by_year': [], 'updated_date': '2024-12-13T14:04:56.886363', 'created_date': '2016-06-24'}