Publication Information

{'id': 'https://openalex.org/W2349424300', 'doi': None, 'title': 'An Algorithm for Minimum Spanning Tree Problem Based on Minimum Degree Constraint', 'display_name': 'An Algorithm for Minimum Spanning Tree Problem Based on Minimum Degree Constraint', 'publication_year': 2008, 'publication_date': '2008-01-01', 'ids': {'openalex': 'https://openalex.org/W2349424300', 'mag': '2349424300'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'http://en.cnki.com.cn/Article_en/CJFDTOTAL-KMLG200805009.htm', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S2764870838', 'display_name': 'Journal of Kunming University of Science and Technology', 'issn_l': None, 'issn': None, 'is_oa': False, 'is_in_doaj': False, 'is_core': False, 'host_organization': 'https://openalex.org/P4361729675', 'host_organization_name': 'Kunming University of Science and Technology', 'host_organization_lineage': ['https://openalex.org/P4361729675'], 'host_organization_lineage_names': ['Kunming University of Science and Technology'], '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/A5058412487', 'display_name': 'Jiao Sen-lin', 'orcid': None}, 'institutions': [{'id': 'https://openalex.org/I149594827', 'display_name': 'Xidian University', 'ror': 'https://ror.org/05s92vm98', 'country_code': 'CN', 'type': 'education', 'lineage': ['https://openalex.org/I149594827']}], 'countries': ['CN'], 'is_corresponding': True, 'raw_author_name': 'Jiao Sen-lin', 'raw_affiliation_strings': ["School of Science Xidian Univ XI'an 710071 China)"], 'affiliations': [{'raw_affiliation_string': "School of Science Xidian Univ XI'an 710071 China)", 'institution_ids': ['https://openalex.org/I149594827']}]}], 'institution_assertions': [], 'countries_distinct_count': 1, 'institutions_distinct_count': 1, 'corresponding_author_ids': ['https://openalex.org/A5058412487'], 'corresponding_institution_ids': ['https://openalex.org/I149594827'], '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': 63}, '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.9467, '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.9467, '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/T12203', 'display_name': 'Mobile Agent-Based Network Management', 'score': 0.939, '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/T14304', 'display_name': 'Transport Systems and Technology', 'score': 0.9264, 'subfield': {'id': 'https://openalex.org/subfields/2210', 'display_name': 'Mechanical 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/degree', 'display_name': 'Degree (music)', 'score': 0.73460376}, {'id': 'https://openalex.org/keywords/reverse-delete-algorithm', 'display_name': 'Reverse-delete algorithm', 'score': 0.64510024}, {'id': 'https://openalex.org/keywords/prims-algorithm', 'display_name': "Prim's algorithm", 'score': 0.5277558}, {'id': 'https://openalex.org/keywords/tree', 'display_name': 'Tree (set theory)', 'score': 0.48512185}, {'id': 'https://openalex.org/keywords/gomory–hu-tree', 'display_name': 'Gomory–Hu tree', 'score': 0.46088004}], 'concepts': [{'id': 'https://openalex.org/C13743678', 'wikidata': 'https://www.wikidata.org/wiki/Q240464', 'display_name': 'Minimum spanning tree', 'level': 2, 'score': 0.8779473}, {'id': 'https://openalex.org/C65949645', 'wikidata': 'https://www.wikidata.org/wiki/Q5283163', 'display_name': 'Distributed minimum spanning tree', 'level': 3, 'score': 0.8139136}, {'id': 'https://openalex.org/C64331007', 'wikidata': 'https://www.wikidata.org/wiki/Q831672', 'display_name': 'Spanning tree', 'level': 2, 'score': 0.8033906}, {'id': 'https://openalex.org/C2775997480', 'wikidata': 'https://www.wikidata.org/wiki/Q586277', 'display_name': 'Degree (music)', 'level': 2, 'score': 0.73460376}, {'id': 'https://openalex.org/C199346575', 'wikidata': 'https://www.wikidata.org/wiki/Q4925151', 'display_name': 'Reverse-delete algorithm', 'level': 4, 'score': 0.64510024}, {'id': 'https://openalex.org/C63645285', 'wikidata': 'https://www.wikidata.org/wiki/Q797860', 'display_name': "Kruskal's algorithm", 'level': 3, 'score': 0.6353617}, {'id': 'https://openalex.org/C145685049', 'wikidata': 'https://www.wikidata.org/wiki/Q4454941', 'display_name': 'Euclidean minimum spanning tree', 'level': 4, 'score': 0.6214754}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.5941829}, {'id': 'https://openalex.org/C55439883', 'wikidata': 'https://www.wikidata.org/wiki/Q360812', 'display_name': 'Correctness', 'level': 2, 'score': 0.5480332}, {'id': 'https://openalex.org/C1649724', 'wikidata': 'https://www.wikidata.org/wiki/Q470813', 'display_name': "Prim's algorithm", 'level': 4, 'score': 0.5277558}, {'id': 'https://openalex.org/C113174947', 'wikidata': 'https://www.wikidata.org/wiki/Q2859736', 'display_name': 'Tree (set theory)', 'level': 2, 'score': 0.48512185}, {'id': 'https://openalex.org/C147517495', 'wikidata': 'https://www.wikidata.org/wiki/Q5581241', 'display_name': 'Gomory–Hu tree', 'level': 5, 'score': 0.46088004}, {'id': 'https://openalex.org/C126255220', 'wikidata': 'https://www.wikidata.org/wiki/Q141495', 'display_name': 'Mathematical optimization', 'level': 1, 'score': 0.41977036}, {'id': 'https://openalex.org/C64271015', 'wikidata': 'https://www.wikidata.org/wiki/Q6865444', 'display_name': 'Minimum degree spanning tree', 'level': 3, 'score': 0.41387084}, {'id': 'https://openalex.org/C11413529', 'wikidata': 'https://www.wikidata.org/wiki/Q8366', 'display_name': 'Algorithm', 'level': 1, 'score': 0.35843354}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.29545677}, {'id': 'https://openalex.org/C100560664', 'wikidata': 'https://www.wikidata.org/wiki/Q3608019', 'display_name': 'K-ary tree', 'level': 4, 'score': 0.27441233}, {'id': 'https://openalex.org/C163797641', 'wikidata': 'https://www.wikidata.org/wiki/Q2067937', 'display_name': 'Tree structure', 'level': 3, 'score': 0.16751078}, {'id': 'https://openalex.org/C197855036', 'wikidata': 'https://www.wikidata.org/wiki/Q380172', 'display_name': 'Binary tree', 'level': 2, 'score': 0.058054686}, {'id': 'https://openalex.org/C121332964', 'wikidata': 'https://www.wikidata.org/wiki/Q413', 'display_name': 'Physics', 'level': 0, 'score': 0.0}, {'id': 'https://openalex.org/C24890656', 'wikidata': 'https://www.wikidata.org/wiki/Q82811', 'display_name': 'Acoustics', 'level': 1, 'score': 0.0}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'http://en.cnki.com.cn/Article_en/CJFDTOTAL-KMLG200805009.htm', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S2764870838', 'display_name': 'Journal of Kunming University of Science and Technology', 'issn_l': None, 'issn': None, 'is_oa': False, 'is_in_doaj': False, 'is_core': False, 'host_organization': 'https://openalex.org/P4361729675', 'host_organization_name': 'Kunming University of Science and Technology', 'host_organization_lineage': ['https://openalex.org/P4361729675'], 'host_organization_lineage_names': ['Kunming University of Science and Technology'], '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/W3010374802', 'https://openalex.org/W2803888831', 'https://openalex.org/W2414514567', 'https://openalex.org/W2396379829', 'https://openalex.org/W2381418104', 'https://openalex.org/W2361573941', 'https://openalex.org/W2355559160', 'https://openalex.org/W2354042733', 'https://openalex.org/W2353025557', 'https://openalex.org/W2352525723', 'https://openalex.org/W2307044859', 'https://openalex.org/W2122848400', 'https://openalex.org/W2059559155', 'https://openalex.org/W2010585027', 'https://openalex.org/W1973100174', 'https://openalex.org/W1971863547', 'https://openalex.org/W1965810411', 'https://openalex.org/W1965702747', 'https://openalex.org/W1576317141', 'https://openalex.org/W1561849181'], 'abstract_inverted_index': {'The': [0], 'concepts': [1], 'of': [2, 29], 'divided': [3, 6, 43], 'graph': [4], 'and': [5, 21, 63], 'number': [7], 'are': [8], 'introduced': [9], 'to': [10, 42], 'handle': [11], 'the': [12, 26, 30, 39, 46, 52], 'degree-constrained': [13], 'minimum': [14, 27], 'spanning': [15, 33, 55], 'tree': [16, 34, 56], 'problem': [17], 'in': [18, 38], 'network': [19, 40], 'design': [20], 'optimization.It': [22], 'is': [23, 60, 65], 'concluded': [24], 'that': [25], 'degree': [28], 'minimum-degree': [31, 53], 'constrained': [32, 54], 'about': [35, 57], 'v0': [36, 58], 'point': [37, 59], 'equal': [41], 'number.Based': [44], 'on': [45], 'above': [47], 'conclusion,a': [48], 'new': [49], 'algorithm': [50], 'for': [51], 'proposed.The': [61], 'correctness': [62], 'effectiveness': [64], 'proved': [66], 'through': [67], 'an': [68], 'example.': [69]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W2349424300', 'counts_by_year': [], 'updated_date': '2024-12-14T09:40:31.958708', 'created_date': '2016-06-24'}