Publication Information

{'id': 'https://openalex.org/W2130375301', 'doi': 'https://doi.org/10.1016/j.proeng.2011.12.679', 'title': 'The Complexity and Algorithm for Minimum Expense Spanning Trees', 'display_name': 'The Complexity and Algorithm for Minimum Expense Spanning Trees', 'publication_year': 2012, 'publication_date': '2012-01-01', 'ids': {'openalex': 'https://openalex.org/W2130375301', 'doi': 'https://doi.org/10.1016/j.proeng.2011.12.679', 'mag': '2130375301'}, 'language': 'en', 'primary_location': {'is_oa': True, 'landing_page_url': 'https://doi.org/10.1016/j.proeng.2011.12.679', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S45645249', 'display_name': 'Procedia Engineering', 'issn_l': '1877-7058', 'issn': ['1877-7058'], 'is_oa': True, 'is_in_doaj': False, 'is_core': True, 'host_organization': 'https://openalex.org/P4310320990', 'host_organization_name': 'Elsevier BV', 'host_organization_lineage': ['https://openalex.org/P4310320990'], 'host_organization_lineage_names': ['Elsevier BV'], 'type': 'journal'}, 'license': None, 'license_id': None, 'version': 'publishedVersion', 'is_accepted': True, 'is_published': True}, 'type': 'article', 'type_crossref': 'journal-article', 'indexed_in': ['crossref'], 'open_access': {'is_oa': True, 'oa_status': 'gold', 'oa_url': 'https://doi.org/10.1016/j.proeng.2011.12.679', 'any_repository_has_fulltext': False}, 'authorships': [{'author_position': 'first', 'author': {'id': 'https://openalex.org/A5109372778', 'display_name': 'Zhan Ning', 'orcid': None}, 'institutions': [{'id': 'https://openalex.org/I38756568', 'display_name': 'Xinyang College of Agriculture and Forestry', 'ror': 'https://ror.org/017t6fa07', 'country_code': 'CN', 'type': 'education', 'lineage': ['https://openalex.org/I38756568']}], 'countries': ['CN'], 'is_corresponding': False, 'raw_author_name': 'Zhan Ning', 'raw_affiliation_strings': ['Mathematics and Computer Science Department, Xinyang Vocational and Technical College, Xinyang 464000, China'], 'affiliations': [{'raw_affiliation_string': 'Mathematics and Computer Science Department, Xinyang Vocational and Technical College, Xinyang 464000, China', 'institution_ids': ['https://openalex.org/I38756568']}]}, {'author_position': 'last', 'author': {'id': 'https://openalex.org/A5086510328', 'display_name': 'Longshu Wu', 'orcid': 'https://orcid.org/0000-0002-2568-5056'}, 'institutions': [{'id': 'https://openalex.org/I55538621', 'display_name': 'China Jiliang University', 'ror': 'https://ror.org/05v1y0t93', 'country_code': 'CN', 'type': 'education', 'lineage': ['https://openalex.org/I55538621']}], 'countries': ['CN'], 'is_corresponding': False, 'raw_author_name': 'Wu Longshu', 'raw_affiliation_strings': ['College of Science, China Jiliang University, Hangzhou 310018, China.'], 'affiliations': [{'raw_affiliation_string': 'College of Science, China Jiliang University, Hangzhou 310018, China.', 'institution_ids': ['https://openalex.org/I55538621']}]}], 'institution_assertions': [], 'countries_distinct_count': 1, 'institutions_distinct_count': 2, 'corresponding_author_ids': [], 'corresponding_institution_ids': [], 'apc_list': None, 'apc_paid': None, 'fwci': 0.0, 'has_fulltext': True, 'fulltext_origin': 'ngrams', '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': '29', 'issue': None, 'first_page': '118', 'last_page': '122'}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T13612', 'display_name': 'Advanced Scientific and Engineering Studies', 'score': 0.997, 'subfield': {'id': 'https://openalex.org/subfields/1803', 'display_name': 'Management Science and Operations Research'}, 'field': {'id': 'https://openalex.org/fields/18', 'display_name': 'Decision Sciences'}, 'domain': {'id': 'https://openalex.org/domains/2', 'display_name': 'Social Sciences'}}, 'topics': [{'id': 'https://openalex.org/T13612', 'display_name': 'Advanced Scientific and Engineering Studies', 'score': 0.997, 'subfield': {'id': 'https://openalex.org/subfields/1803', 'display_name': 'Management Science and Operations Research'}, 'field': {'id': 'https://openalex.org/fields/18', 'display_name': 'Decision Sciences'}, 'domain': {'id': 'https://openalex.org/domains/2', 'display_name': 'Social Sciences'}}, {'id': 'https://openalex.org/T12176', 'display_name': 'Optimization and Packing Problems', 'score': 0.9837, 'subfield': {'id': 'https://openalex.org/subfields/2209', 'display_name': 'Industrial and Manufacturing 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/T12203', 'display_name': 'Mobile Agent-Based Network Management', 'score': 0.9818, '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/prims-algorithm', 'display_name': "Prim's algorithm", 'score': 0.7850449}, {'id': 'https://openalex.org/keywords/k-minimum-spanning-tree', 'display_name': 'k-minimum spanning tree', 'score': 0.732703}, {'id': 'https://openalex.org/keywords/reverse-delete-algorithm', 'display_name': 'Reverse-delete algorithm', 'score': 0.6847476}, {'id': 'https://openalex.org/keywords/gomory–hu-tree', 'display_name': 'Gomory–Hu tree', 'score': 0.49782538}], 'concepts': [{'id': 'https://openalex.org/C13743678', 'wikidata': 'https://www.wikidata.org/wiki/Q240464', 'display_name': 'Minimum spanning tree', 'level': 2, 'score': 0.8775003}, {'id': 'https://openalex.org/C64331007', 'wikidata': 'https://www.wikidata.org/wiki/Q831672', 'display_name': 'Spanning tree', 'level': 2, 'score': 0.86871743}, {'id': 'https://openalex.org/C63645285', 'wikidata': 'https://www.wikidata.org/wiki/Q797860', 'display_name': "Kruskal's algorithm", 'level': 3, 'score': 0.8635026}, {'id': 'https://openalex.org/C1649724', 'wikidata': 'https://www.wikidata.org/wiki/Q470813', 'display_name': "Prim's algorithm", 'level': 4, 'score': 0.7850449}, {'id': 'https://openalex.org/C65949645', 'wikidata': 'https://www.wikidata.org/wiki/Q5283163', 'display_name': 'Distributed minimum spanning tree', 'level': 3, 'score': 0.77727926}, {'id': 'https://openalex.org/C202750272', 'wikidata': 'https://www.wikidata.org/wiki/Q6322849', 'display_name': 'k-minimum spanning tree', 'level': 5, 'score': 0.732703}, {'id': 'https://openalex.org/C199346575', 'wikidata': 'https://www.wikidata.org/wiki/Q4925151', 'display_name': 'Reverse-delete algorithm', 'level': 4, 'score': 0.6847476}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.5152157}, {'id': 'https://openalex.org/C80899671', 'wikidata': 'https://www.wikidata.org/wiki/Q1304193', 'display_name': 'Vertex (graph theory)', 'level': 3, 'score': 0.5094393}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.50691587}, {'id': 'https://openalex.org/C147517495', 'wikidata': 'https://www.wikidata.org/wiki/Q5581241', 'display_name': 'Gomory–Hu tree', 'level': 5, 'score': 0.49782538}, {'id': 'https://openalex.org/C311688', 'wikidata': 'https://www.wikidata.org/wiki/Q2393193', 'display_name': 'Time complexity', 'level': 2, 'score': 0.49597177}, {'id': 'https://openalex.org/C64271015', 'wikidata': 'https://www.wikidata.org/wiki/Q6865444', 'display_name': 'Minimum degree spanning tree', 'level': 3, 'score': 0.44750392}, {'id': 'https://openalex.org/C145685049', 'wikidata': 'https://www.wikidata.org/wiki/Q4454941', 'display_name': 'Euclidean minimum spanning tree', 'level': 4, 'score': 0.43135375}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.38270319}, {'id': 'https://openalex.org/C11413529', 'wikidata': 'https://www.wikidata.org/wiki/Q8366', 'display_name': 'Algorithm', 'level': 1, 'score': 0.36453363}, {'id': 'https://openalex.org/C132525143', 'wikidata': 'https://www.wikidata.org/wiki/Q141488', 'display_name': 'Graph', 'level': 2, 'score': 0.33719736}, {'id': 'https://openalex.org/C163797641', 'wikidata': 'https://www.wikidata.org/wiki/Q2067937', 'display_name': 'Tree structure', 'level': 3, 'score': 0.2128782}, {'id': 'https://openalex.org/C100560664', 'wikidata': 'https://www.wikidata.org/wiki/Q3608019', 'display_name': 'K-ary tree', 'level': 4, 'score': 0.21004462}, {'id': 'https://openalex.org/C197855036', 'wikidata': 'https://www.wikidata.org/wiki/Q380172', 'display_name': 'Binary tree', 'level': 2, 'score': 0.089723855}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': True, 'landing_page_url': 'https://doi.org/10.1016/j.proeng.2011.12.679', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S45645249', 'display_name': 'Procedia Engineering', 'issn_l': '1877-7058', 'issn': ['1877-7058'], 'is_oa': True, 'is_in_doaj': False, 'is_core': True, 'host_organization': 'https://openalex.org/P4310320990', 'host_organization_name': 'Elsevier BV', 'host_organization_lineage': ['https://openalex.org/P4310320990'], 'host_organization_lineage_names': ['Elsevier BV'], 'type': 'journal'}, 'license': None, 'license_id': None, 'version': 'publishedVersion', 'is_accepted': True, 'is_published': True}], 'best_oa_location': {'is_oa': True, 'landing_page_url': 'https://doi.org/10.1016/j.proeng.2011.12.679', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S45645249', 'display_name': 'Procedia Engineering', 'issn_l': '1877-7058', 'issn': ['1877-7058'], 'is_oa': True, 'is_in_doaj': False, 'is_core': True, 'host_organization': 'https://openalex.org/P4310320990', 'host_organization_name': 'Elsevier BV', 'host_organization_lineage': ['https://openalex.org/P4310320990'], 'host_organization_lineage_names': ['Elsevier BV'], 'type': 'journal'}, 'license': None, 'license_id': None, 'version': 'publishedVersion', 'is_accepted': True, 'is_published': True}, 'sustainable_development_goals': [{'display_name': 'Decent work and economic growth', 'id': 'https://metadata.un.org/sdg/8', 'score': 0.43}], 'grants': [], 'datasets': [], 'versions': [], 'referenced_works_count': 6, 'referenced_works': ['https://openalex.org/W1484040084', 'https://openalex.org/W2058715873', 'https://openalex.org/W2080618012', 'https://openalex.org/W2119471783', 'https://openalex.org/W2238261330', 'https://openalex.org/W3214074647'], 'related_works': ['https://openalex.org/W3081212354', 'https://openalex.org/W2943635264', 'https://openalex.org/W2390742649', 'https://openalex.org/W2361573941', 'https://openalex.org/W2353822696', 'https://openalex.org/W2281826919', 'https://openalex.org/W2130375301', 'https://openalex.org/W1965702747', 'https://openalex.org/W1587959445', 'https://openalex.org/W1576317141'], 'abstract_inverted_index': {'The': [0], 'minimum': [1, 70, 86], 'spanning': [2, 72, 80, 117], 'tree': [3, 73, 81], 'problem': [4, 93], 'is': [5, 76, 94], 'a': [6, 31, 79, 83, 103, 116], 'classical': [7], 'and': [8, 23, 44], 'well-known': [9], 'combinatorial': [10], 'optimization': [11], 'problem.': [12], 'There': [13], 'exist': [14], 'many': [15, 47], 'efficient': [16], 'algorithms': [17], 'such': [18], 'as': [19, 36, 38], 'the': [20, 34, 39, 50, 55, 58, 65, 69, 110, 113], 'Kruskal': [21], 'algorithm': [22, 25, 106], 'Prim': [24], 'to': [26, 54, 77], 'solve': [27], 'it.': [28], 'But': [29], 'in': [30, 82, 96, 115], 'real': [32], 'network,': [33], 'vertices': [35, 114], 'well': [37], 'edges': [40], 'may': [41], 'have': [42], 'weights,': [43], 'there': [45], 'are': [46], 'cases': [48], 'of': [49, 57, 68, 112], 'vertex': [51], 'weights': [52, 111], 'according': [53], 'degrees': [56], 'vertices.': [59], 'In': [60], 'this': [61, 92], 'paper,': [62], 'we': [63, 101], 'consider': [64], 'computational': [66], 'complexity': [67], 'expense': [71], 'problem,': [74], 'which': [75], 'find': [78], 'network': [84], 'with': [85], 'total': [87], 'expenses.': [88], 'We': [89], 'show': [90], 'that': [91], 'NP-hard': [95], 'some': [97], 'general': [98], 'situations.': [99], 'And': [100], 'propose': [102], 'polynomial': [104], 'time': [105], 'when': [107], 'computing': [108], 'all': [109], 'tree.': [118]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W2130375301', 'counts_by_year': [], 'updated_date': '2024-12-11T04:48:19.258973', 'created_date': '2016-06-24'}