Publication Information

{'id': 'https://openalex.org/W2353025557', 'doi': None, 'title': 'A minimum spanning tree algorithm based on binary coding', 'display_name': 'A minimum spanning tree algorithm based on binary coding', 'publication_year': 2012, 'publication_date': '2012-01-01', 'ids': {'openalex': 'https://openalex.org/W2353025557', 'mag': '2353025557'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://en.cnki.com.cn/Article_en/CJFDTOTAL-WHSP201201011.htm', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S2764768469', 'display_name': 'Journal of Wuhan Polytechnic University', 'issn_l': None, 'issn': None, 'is_oa': False, 'is_in_doaj': False, 'is_core': False, 'host_organization': 'https://openalex.org/P4366370259', 'host_organization_name': 'Wuhan Polytechnic University', 'host_organization_lineage': ['https://openalex.org/P4366370259'], 'host_organization_lineage_names': ['Wuhan Polytechnic 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/A5049332631', 'display_name': 'Fangxiu Wang', 'orcid': 'https://orcid.org/0009-0005-3306-0776'}, 'institutions': [{'id': 'https://openalex.org/I14116566', 'display_name': 'Wuhan Polytechnic University', 'ror': 'https://ror.org/05w0e5j23', 'country_code': 'CN', 'type': 'education', 'lineage': ['https://openalex.org/I14116566']}], 'countries': ['CN'], 'is_corresponding': True, 'raw_author_name': 'Wang Fang-xiu', 'raw_affiliation_strings': ['School of Mathematics & Computer Science, Wuhan Polytechnic University, Wuhan 430023, China.'], 'affiliations': [{'raw_affiliation_string': 'School of Mathematics & Computer Science, Wuhan Polytechnic University, Wuhan 430023, China.', 'institution_ids': ['https://openalex.org/I14116566']}]}], 'institution_assertions': [], 'countries_distinct_count': 1, 'institutions_distinct_count': 1, 'corresponding_author_ids': ['https://openalex.org/A5049332631'], 'corresponding_institution_ids': ['https://openalex.org/I14116566'], '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/T12941', 'display_name': 'Embedded Systems and FPGA Design', 'score': 0.9103, 'subfield': {'id': 'https://openalex.org/subfields/2207', 'display_name': 'Control and Systems 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/T12941', 'display_name': 'Embedded Systems and FPGA Design', 'score': 0.9103, 'subfield': {'id': 'https://openalex.org/subfields/2207', 'display_name': 'Control and Systems 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/reverse-delete-algorithm', 'display_name': 'Reverse-delete algorithm', 'score': 0.78325754}, {'id': 'https://openalex.org/keywords/prims-algorithm', 'display_name': "Prim's algorithm", 'score': 0.6543076}, {'id': 'https://openalex.org/keywords/k-minimum-spanning-tree', 'display_name': 'k-minimum spanning tree', 'score': 0.41798288}], 'concepts': [{'id': 'https://openalex.org/C64331007', 'wikidata': 'https://www.wikidata.org/wiki/Q831672', 'display_name': 'Spanning tree', 'level': 2, 'score': 0.8861349}, {'id': 'https://openalex.org/C13743678', 'wikidata': 'https://www.wikidata.org/wiki/Q240464', 'display_name': 'Minimum spanning tree', 'level': 2, 'score': 0.8635326}, {'id': 'https://openalex.org/C63645285', 'wikidata': 'https://www.wikidata.org/wiki/Q797860', 'display_name': "Kruskal's algorithm", 'level': 3, 'score': 0.8417026}, {'id': 'https://openalex.org/C65949645', 'wikidata': 'https://www.wikidata.org/wiki/Q5283163', 'display_name': 'Distributed minimum spanning tree', 'level': 3, 'score': 0.8152104}, {'id': 'https://openalex.org/C199346575', 'wikidata': 'https://www.wikidata.org/wiki/Q4925151', 'display_name': 'Reverse-delete algorithm', 'level': 4, 'score': 0.78325754}, {'id': 'https://openalex.org/C1649724', 'wikidata': 'https://www.wikidata.org/wiki/Q470813', 'display_name': "Prim's algorithm", 'level': 4, 'score': 0.6543076}, {'id': 'https://openalex.org/C145685049', 'wikidata': 'https://www.wikidata.org/wiki/Q4454941', 'display_name': 'Euclidean minimum spanning tree', 'level': 4, 'score': 0.6396446}, {'id': 'https://openalex.org/C37810922', 'wikidata': 'https://www.wikidata.org/wiki/Q5161409', 'display_name': 'Connected dominating set', 'level': 3, 'score': 0.61885107}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.49188733}, {'id': 'https://openalex.org/C197855036', 'wikidata': 'https://www.wikidata.org/wiki/Q380172', 'display_name': 'Binary tree', 'level': 2, 'score': 0.4429271}, {'id': 'https://openalex.org/C11413529', 'wikidata': 'https://www.wikidata.org/wiki/Q8366', 'display_name': 'Algorithm', 'level': 1, 'score': 0.42857155}, {'id': 'https://openalex.org/C132525143', 'wikidata': 'https://www.wikidata.org/wiki/Q141488', 'display_name': 'Graph', 'level': 2, 'score': 0.41846946}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.4182657}, {'id': 'https://openalex.org/C202750272', 'wikidata': 'https://www.wikidata.org/wiki/Q6322849', 'display_name': 'k-minimum spanning tree', 'level': 5, 'score': 0.41798288}, {'id': 'https://openalex.org/C179518139', 'wikidata': 'https://www.wikidata.org/wiki/Q5140297', 'display_name': 'Coding (social sciences)', 'level': 2, 'score': 0.4159188}, {'id': 'https://openalex.org/C100560664', 'wikidata': 'https://www.wikidata.org/wiki/Q3608019', 'display_name': 'K-ary tree', 'level': 4, 'score': 0.39599746}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.28142548}, {'id': 'https://openalex.org/C80444323', 'wikidata': 'https://www.wikidata.org/wiki/Q2878974', 'display_name': 'Theoretical computer science', 'level': 1, 'score': 0.24020657}, {'id': 'https://openalex.org/C163797641', 'wikidata': 'https://www.wikidata.org/wiki/Q2067937', 'display_name': 'Tree structure', 'level': 3, 'score': 0.16307828}, {'id': 'https://openalex.org/C105795698', 'wikidata': 'https://www.wikidata.org/wiki/Q12483', 'display_name': 'Statistics', 'level': 1, 'score': 0.0}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'https://en.cnki.com.cn/Article_en/CJFDTOTAL-WHSP201201011.htm', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S2764768469', 'display_name': 'Journal of Wuhan Polytechnic University', 'issn_l': None, 'issn': None, 'is_oa': False, 'is_in_doaj': False, 'is_core': False, 'host_organization': 'https://openalex.org/P4366370259', 'host_organization_name': 'Wuhan Polytechnic University', 'host_organization_lineage': ['https://openalex.org/P4366370259'], 'host_organization_lineage_names': ['Wuhan Polytechnic 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/W3195481350', 'https://openalex.org/W3010374802', 'https://openalex.org/W2911818503', 'https://openalex.org/W2899787781', 'https://openalex.org/W2396379829', 'https://openalex.org/W2361573941', 'https://openalex.org/W2361181950', 'https://openalex.org/W2330693523', 'https://openalex.org/W2183023257', 'https://openalex.org/W2122848400', 'https://openalex.org/W2107862727', 'https://openalex.org/W2041080724', 'https://openalex.org/W2011824743', 'https://openalex.org/W1973100174', 'https://openalex.org/W1966758665', 'https://openalex.org/W1966456128', 'https://openalex.org/W1965702747', 'https://openalex.org/W1738503018', 'https://openalex.org/W1593284275', 'https://openalex.org/W1491195793'], 'abstract_inverted_index': {'Through': [0], 'the': [1, 27, 32, 35, 43, 47, 50, 58, 62, 65, 71, 77, 80, 87, 92, 103], 'current': [2], 'minimum': [3, 11, 18, 36, 88], 'spanning': [4, 12, 19, 37, 89], 'tree': [5, 20, 45, 60], 'algorithm,we': [6], 'can': [7, 84], 'only': [8], 'get': [9], 'a': [10, 16], 'tree.So': [13], 'we': [14, 83], 'present': [15], 'new': [17], 'algorithm.The': [21], 'algorithm': [22, 72, 104], 'is': [23, 53, 73], 'mainly': [24], 'to': [25, 74], 'use': [26], 'binary': [28], 'code': [29], 'and': [30], 'combine': [31], 'characteristics': [33], 'of': [34, 42, 49, 57, 64, 70, 91, 97], 'tree.At': [38], 'first,it': [39], 'eliminates': [40, 55], 'some': [41, 56], 'non-spanning': [44, 59], 'through': [46, 61], 'number': [48], 'graph': [51, 66, 94], 'edge.What': [52], 'more,it': [54], 'judgement': [63], 'connectivity.In': [67], 'fact,the': [68], 'nature': [69], 'look': [75], 'for': [76], 'best': [78], 'in': [79, 95], 'global': [81], 'scope.So': [82], 'find': [85], 'all': [86], 'trees': [90], 'connected': [93], 'view': [96], 'this': [98], 'algorithm.An': [99], 'example': [100], 'shows': [101], 'that': [102], 'has': [105], 'clear': [106], 'steps,convenient': [107], 'program': [108], 'implementation,general': [109], 'good': [110], 'characteristic.': [111]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W2353025557', 'counts_by_year': [], 'updated_date': '2024-12-09T01:57:42.556977', 'created_date': '2016-06-24'}