Publication Information

{'id': 'https://openalex.org/W2361573941', 'doi': None, 'title': 'New fast algorithm for degree-constrained minimum spanning tree problem', 'display_name': 'New fast algorithm for degree-constrained minimum spanning tree problem', 'publication_year': 2008, 'publication_date': '2008-01-01', 'ids': {'openalex': 'https://openalex.org/W2361573941', 'mag': '2361573941'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'http://en.cnki.com.cn/Article_en/CJFDTOTAL-JSGG200831014.htm', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S2764896880', 'display_name': 'Computer Engineering and Applications Journal', 'issn_l': '2252-4274', 'issn': ['2252-4274', '2252-5459'], 'is_oa': True, 'is_in_doaj': False, 'is_core': False, 'host_organization': 'https://openalex.org/P4310315074', 'host_organization_name': 'Sriwijaya University', 'host_organization_lineage': ['https://openalex.org/P4310315074'], 'host_organization_lineage_names': ['Sriwijaya 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/A5103658963', 'display_name': 'Chen Hong-qin', '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': 'Chen Hong-qin', '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/A5103658963'], '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/T12176', 'display_name': 'Optimization and Packing Problems', 'score': 0.9891, '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'}}, 'topics': [{'id': 'https://openalex.org/T12176', 'display_name': 'Optimization and Packing Problems', 'score': 0.9891, '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/T11596', 'display_name': 'Constraint Satisfaction and Optimization', 'score': 0.9753, '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/T10996', 'display_name': 'Computational Geometry and Mesh Generation', 'score': 0.9627, 'subfield': {'id': 'https://openalex.org/subfields/1704', 'display_name': 'Computer Graphics and Computer-Aided Design'}, '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/degree', 'display_name': 'Degree (music)', 'score': 0.641482}, {'id': 'https://openalex.org/keywords/gomory–hu-tree', 'display_name': 'Gomory–Hu tree', 'score': 0.6029569}, {'id': 'https://openalex.org/keywords/prims-algorithm', 'display_name': "Prim's algorithm", 'score': 0.6020401}, {'id': 'https://openalex.org/keywords/k-minimum-spanning-tree', 'display_name': 'k-minimum spanning tree', 'score': 0.5644221}, {'id': 'https://openalex.org/keywords/tree', 'display_name': 'Tree (set theory)', 'score': 0.556546}, {'id': 'https://openalex.org/keywords/reverse-delete-algorithm', 'display_name': 'Reverse-delete algorithm', 'score': 0.530236}, {'id': 'https://openalex.org/keywords/minimum-weight', 'display_name': 'Minimum weight', 'score': 0.44744805}], 'concepts': [{'id': 'https://openalex.org/C13743678', 'wikidata': 'https://www.wikidata.org/wiki/Q240464', 'display_name': 'Minimum spanning tree', 'level': 2, 'score': 0.79631877}, {'id': 'https://openalex.org/C65949645', 'wikidata': 'https://www.wikidata.org/wiki/Q5283163', 'display_name': 'Distributed minimum spanning tree', 'level': 3, 'score': 0.7952107}, {'id': 'https://openalex.org/C64331007', 'wikidata': 'https://www.wikidata.org/wiki/Q831672', 'display_name': 'Spanning tree', 'level': 2, 'score': 0.77573806}, {'id': 'https://openalex.org/C2775997480', 'wikidata': 'https://www.wikidata.org/wiki/Q586277', 'display_name': 'Degree (music)', 'level': 2, 'score': 0.641482}, {'id': 'https://openalex.org/C147517495', 'wikidata': 'https://www.wikidata.org/wiki/Q5581241', 'display_name': 'Gomory–Hu tree', 'level': 5, 'score': 0.6029569}, {'id': 'https://openalex.org/C1649724', 'wikidata': 'https://www.wikidata.org/wiki/Q470813', 'display_name': "Prim's algorithm", 'level': 4, 'score': 0.6020401}, {'id': 'https://openalex.org/C145685049', 'wikidata': 'https://www.wikidata.org/wiki/Q4454941', 'display_name': 'Euclidean minimum spanning tree', 'level': 4, 'score': 0.5958876}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.57395387}, {'id': 'https://openalex.org/C202750272', 'wikidata': 'https://www.wikidata.org/wiki/Q6322849', 'display_name': 'k-minimum spanning tree', 'level': 5, 'score': 0.5644221}, {'id': 'https://openalex.org/C113174947', 'wikidata': 'https://www.wikidata.org/wiki/Q2859736', 'display_name': 'Tree (set theory)', 'level': 2, 'score': 0.556546}, {'id': 'https://openalex.org/C63645285', 'wikidata': 'https://www.wikidata.org/wiki/Q797860', 'display_name': "Kruskal's algorithm", 'level': 3, 'score': 0.53803045}, {'id': 'https://openalex.org/C199346575', 'wikidata': 'https://www.wikidata.org/wiki/Q4925151', 'display_name': 'Reverse-delete algorithm', 'level': 4, 'score': 0.530236}, {'id': 'https://openalex.org/C162307627', 'wikidata': 'https://www.wikidata.org/wiki/Q204833', 'display_name': 'Enhanced Data Rates for GSM Evolution', 'level': 2, 'score': 0.49976087}, {'id': 'https://openalex.org/C2778945305', 'wikidata': 'https://www.wikidata.org/wiki/Q6865502', 'display_name': 'Minimum weight', 'level': 2, 'score': 0.44744805}, {'id': 'https://openalex.org/C11413529', 'wikidata': 'https://www.wikidata.org/wiki/Q8366', 'display_name': 'Algorithm', 'level': 1, 'score': 0.39348018}, {'id': 'https://openalex.org/C100560664', 'wikidata': 'https://www.wikidata.org/wiki/Q3608019', 'display_name': 'K-ary tree', 'level': 4, 'score': 0.36547172}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.3392607}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.3283069}, {'id': 'https://openalex.org/C163797641', 'wikidata': 'https://www.wikidata.org/wiki/Q2067937', 'display_name': 'Tree structure', 'level': 3, 'score': 0.258159}, {'id': 'https://openalex.org/C197855036', 'wikidata': 'https://www.wikidata.org/wiki/Q380172', 'display_name': 'Binary tree', 'level': 2, 'score': 0.1055069}, {'id': 'https://openalex.org/C154945302', 'wikidata': 'https://www.wikidata.org/wiki/Q11660', 'display_name': 'Artificial intelligence', 'level': 1, 'score': 0.052354723}, {'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-JSGG200831014.htm', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S2764896880', 'display_name': 'Computer Engineering and Applications Journal', 'issn_l': '2252-4274', 'issn': ['2252-4274', '2252-5459'], 'is_oa': True, 'is_in_doaj': False, 'is_core': False, 'host_organization': 'https://openalex.org/P4310315074', 'host_organization_name': 'Sriwijaya University', 'host_organization_lineage': ['https://openalex.org/P4310315074'], 'host_organization_lineage_names': ['Sriwijaya 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/W3119752030', 'https://openalex.org/W3010374802', 'https://openalex.org/W2396379829', 'https://openalex.org/W2381418104', 'https://openalex.org/W2379753072', 'https://openalex.org/W2353025557', 'https://openalex.org/W2352525723', 'https://openalex.org/W2349424300', 'https://openalex.org/W2181570200', 'https://openalex.org/W2122848400', 'https://openalex.org/W2107862727', 'https://openalex.org/W2023638076', 'https://openalex.org/W2011824743', 'https://openalex.org/W2010585027', 'https://openalex.org/W1973100174', 'https://openalex.org/W1965810411', 'https://openalex.org/W1965702747', 'https://openalex.org/W1958279402', 'https://openalex.org/W1593284275', 'https://openalex.org/W1491195793'], 'abstract_inverted_index': {'A': [0], 'new': [1, 13, 99], 'fast': [2, 100], 'algorithm': [3, 14, 101], 'for': [4], 'the': [5, 38, 43, 50, 53, 56, 68, 72, 76, 79, 84, 91, 98], 'degree-constrained': [6, 24, 39], 'minimum': [7, 28], 'spanning': [8, 29], 'tree': [9, 25, 40, 80], 'problem': [10], 'is': [11, 81, 88], 'proposed.The': [12], 'consists': [15], 'of': [16, 49, 55, 78], 'two': [17, 59, 92], 'major': [18], 'parts.The': [19], 'first': [20, 44], 'part': [21, 32], 'constructs': [22], 'a': [23, 27], 'from': [26, 42, 83], 'tree.The': [30], 'second': [31], 'presents': [33], 'an': [34], 'improvement': [35], 'strategy.Based': [36], 'on': [37], 'obtained': [41], 'part,it': [45], 'removes': [46], 'one': [47], 'edge': [48, 64, 85], 'tree,as': [51], 'divides': [52], 'vertices': [54], 'graph': [57], 'into': [58], 'sets': [60], 'by': [61, 90], 'connectivity.The': [62], 'added': [63], 'which': [65, 87], 'doesn’t': [66], 'violate': [67], 'degree-constraint': [69], 'and': [70], 'offers': [71], 'maximum': [73], 'reduction': [74], 'in': [75], 'weight': [77], 'selected': [82], 'cut': [86], 'got': [89], 'sets.Many': [93], 'numerical': [94], 'tests': [95], 'show': [96], 'that': [97], 'has': [102], 'very': [103], 'good': [104], 'performance.': [105]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W2361573941', 'counts_by_year': [], 'updated_date': '2024-12-09T02:05:32.189102', 'created_date': '2016-06-24'}