Publication Information

{'id': 'https://openalex.org/W2358746580', 'doi': None, 'title': 'A practical algorithm for constructing a minimum spanning tree', 'display_name': 'A practical algorithm for constructing a minimum spanning tree', 'publication_year': 2003, 'publication_date': '2003-01-01', 'ids': {'openalex': 'https://openalex.org/W2358746580', 'mag': '2358746580'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://en.cnki.com.cn/Article_en/CJFDTOTAL-DNXJ200305001.htm', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S4306417957', 'display_name': 'Computer and Information Technology', 'issn_l': None, 'issn': None, 'is_oa': False, 'is_in_doaj': False, 'is_core': False, 'host_organization': None, 'host_organization_name': None, 'host_organization_lineage': [], 'host_organization_lineage_names': [], 'type': 'conference'}, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}, 'type': 'article', 'type_crossref': 'proceedings-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/A5049992889', 'display_name': 'Chen Hepin', 'orcid': None}, 'institutions': [], 'countries': [], 'is_corresponding': True, 'raw_author_name': 'Chen Hepin', 'raw_affiliation_strings': [], 'affiliations': []}], 'institution_assertions': [], 'countries_distinct_count': 0, 'institutions_distinct_count': 0, 'corresponding_author_ids': ['https://openalex.org/A5049992889'], 'corresponding_institution_ids': [], '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': 59}, '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.9479, '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.9479, '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/T14446', 'display_name': 'Civil and Geotechnical Engineering Research', 'score': 0.9357, 'subfield': {'id': 'https://openalex.org/subfields/2200', 'display_name': 'General 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/T11106', 'display_name': 'Data Management and Algorithms', 'score': 0.9216, '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'}}], 'keywords': [{'id': 'https://openalex.org/keywords/prims-algorithm', 'display_name': "Prim's algorithm", 'score': 0.7445834}, {'id': 'https://openalex.org/keywords/reverse-delete-algorithm', 'display_name': 'Reverse-delete algorithm', 'score': 0.6614363}, {'id': 'https://openalex.org/keywords/algorithm-design', 'display_name': 'Algorithm design', 'score': 0.44592583}, {'id': 'https://openalex.org/keywords/k-minimum-spanning-tree', 'display_name': 'k-minimum spanning tree', 'score': 0.4454235}, {'id': 'https://openalex.org/keywords/tree', 'display_name': 'Tree (set theory)', 'score': 0.4130727}], 'concepts': [{'id': 'https://openalex.org/C13743678', 'wikidata': 'https://www.wikidata.org/wiki/Q240464', 'display_name': 'Minimum spanning tree', 'level': 2, 'score': 0.804509}, {'id': 'https://openalex.org/C65949645', 'wikidata': 'https://www.wikidata.org/wiki/Q5283163', 'display_name': 'Distributed minimum spanning tree', 'level': 3, 'score': 0.78240836}, {'id': 'https://openalex.org/C1649724', 'wikidata': 'https://www.wikidata.org/wiki/Q470813', 'display_name': "Prim's algorithm", 'level': 4, 'score': 0.7445834}, {'id': 'https://openalex.org/C64331007', 'wikidata': 'https://www.wikidata.org/wiki/Q831672', 'display_name': 'Spanning tree', 'level': 2, 'score': 0.695029}, {'id': 'https://openalex.org/C63645285', 'wikidata': 'https://www.wikidata.org/wiki/Q797860', 'display_name': "Kruskal's algorithm", 'level': 3, 'score': 0.6910675}, {'id': 'https://openalex.org/C199346575', 'wikidata': 'https://www.wikidata.org/wiki/Q4925151', 'display_name': 'Reverse-delete algorithm', 'level': 4, 'score': 0.6614363}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.63980395}, {'id': 'https://openalex.org/C11413529', 'wikidata': 'https://www.wikidata.org/wiki/Q8366', 'display_name': 'Algorithm', 'level': 1, 'score': 0.54880834}, {'id': 'https://openalex.org/C106516650', 'wikidata': 'https://www.wikidata.org/wiki/Q8366', 'display_name': 'Algorithm design', 'level': 2, 'score': 0.44592583}, {'id': 'https://openalex.org/C202750272', 'wikidata': 'https://www.wikidata.org/wiki/Q6322849', 'display_name': 'k-minimum spanning tree', 'level': 5, 'score': 0.4454235}, {'id': 'https://openalex.org/C113174947', 'wikidata': 'https://www.wikidata.org/wiki/Q2859736', 'display_name': 'Tree (set theory)', 'level': 2, 'score': 0.4130727}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.24698606}, {'id': 'https://openalex.org/C163797641', 'wikidata': 'https://www.wikidata.org/wiki/Q2067937', 'display_name': 'Tree structure', 'level': 3, 'score': 0.20063367}, {'id': 'https://openalex.org/C100560664', 'wikidata': 'https://www.wikidata.org/wiki/Q3608019', 'display_name': 'K-ary tree', 'level': 4, 'score': 0.17533228}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.14436147}, {'id': 'https://openalex.org/C197855036', 'wikidata': 'https://www.wikidata.org/wiki/Q380172', 'display_name': 'Binary tree', 'level': 2, 'score': 0.12319833}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'https://en.cnki.com.cn/Article_en/CJFDTOTAL-DNXJ200305001.htm', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S4306417957', 'display_name': 'Computer and Information Technology', 'issn_l': None, 'issn': None, 'is_oa': False, 'is_in_doaj': False, 'is_core': False, 'host_organization': None, 'host_organization_name': None, 'host_organization_lineage': [], 'host_organization_lineage_names': [], 'type': 'conference'}, '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/W3023158453', 'https://openalex.org/W2477124885', 'https://openalex.org/W2391455976', 'https://openalex.org/W2388143981', 'https://openalex.org/W2371157450', 'https://openalex.org/W2367883989', 'https://openalex.org/W2365289604', 'https://openalex.org/W2363076693', 'https://openalex.org/W2360026231', 'https://openalex.org/W2355706734', 'https://openalex.org/W2353822696', 'https://openalex.org/W2349955314', 'https://openalex.org/W2348255823', 'https://openalex.org/W2126785038', 'https://openalex.org/W2116534421', 'https://openalex.org/W2108123796', 'https://openalex.org/W2095166134', 'https://openalex.org/W2055747731', 'https://openalex.org/W2040791573', 'https://openalex.org/W1977899923'], 'abstract_inverted_index': {'This': [0], 'paper': [1], 'developed': [2], 'a': [3, 8], 'new': [4], 'algorithm': [5, 12, 28], 'for': [6, 25], 'constructing': [7], 'minimum': [9], 'spanning': [10], 'tree.The': [11], 'does': [13], 'this': [14], 'by': [15, 23], 'cutting': [16], 'lines': [17], 'from': [18], 'the': [19], 'original': [20], 'graph': [21], 'step': [22], 'step,': [24], 'smallscale': [26], 'graphs,this': [27], 'has': [29], 'apparent': [30], 'advantages': [31], 'over': [32], 'traditional': [33], 'algorithms.': [34]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W2358746580', 'counts_by_year': [], 'updated_date': '2024-12-08T08:36:25.778651', 'created_date': '2016-06-24'}