Publication Information

{'id': 'https://openalex.org/W1973100174', 'doi': 'https://doi.org/10.1109/icmse.2007.4421877', 'title': 'Solving Degree-constrained Minimum Spanning Tree with a New Algorithm', 'display_name': 'Solving Degree-constrained Minimum Spanning Tree with a New Algorithm', 'publication_year': 2007, 'publication_date': '2007-08-01', 'ids': {'openalex': 'https://openalex.org/W1973100174', 'doi': 'https://doi.org/10.1109/icmse.2007.4421877', 'mag': '1973100174'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://doi.org/10.1109/icmse.2007.4421877', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S4306419651', 'display_name': 'International Conference on Management Science and Engineering', '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': ['crossref'], '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/A5054243342', 'display_name': 'Ning Ai-bing', 'orcid': None}, 'institutions': [{'id': 'https://openalex.org/I148128674', 'display_name': 'University of Shanghai for Science and Technology', 'ror': 'https://ror.org/00ay9v204', 'country_code': 'CN', 'type': 'education', 'lineage': ['https://openalex.org/I148128674']}], 'countries': ['CN'], 'is_corresponding': False, 'raw_author_name': 'Ning Ai-bing', 'raw_affiliation_strings': ['Univ. of Shanghai for Sci. & Technol., Shanghai'], 'affiliations': [{'raw_affiliation_string': 'Univ. of Shanghai for Sci. & Technol., Shanghai', 'institution_ids': ['https://openalex.org/I148128674']}]}, {'author_position': 'middle', 'author': {'id': 'https://openalex.org/A5090764760', 'display_name': 'Ma Liang', 'orcid': 'https://orcid.org/0000-0002-9786-5857'}, 'institutions': [{'id': 'https://openalex.org/I148128674', 'display_name': 'University of Shanghai for Science and Technology', 'ror': 'https://ror.org/00ay9v204', 'country_code': 'CN', 'type': 'education', 'lineage': ['https://openalex.org/I148128674']}], 'countries': ['CN'], 'is_corresponding': False, 'raw_author_name': 'Ma Liang', 'raw_affiliation_strings': ['Univ. of Shanghai for Sci. & Technol., Shanghai'], 'affiliations': [{'raw_affiliation_string': 'Univ. of Shanghai for Sci. & Technol., Shanghai', 'institution_ids': ['https://openalex.org/I148128674']}]}, {'author_position': 'last', 'author': {'id': 'https://openalex.org/A5102140881', 'display_name': 'Xiong Xiao-hua', 'orcid': None}, 'institutions': [{'id': 'https://openalex.org/I135905480', 'display_name': 'Shanghai Polytechnic University', 'ror': 'https://ror.org/02as5yg64', 'country_code': 'CN', 'type': 'education', 'lineage': ['https://openalex.org/I135905480']}], 'countries': ['CN'], 'is_corresponding': False, 'raw_author_name': 'Xiong Xiao-hua', 'raw_affiliation_strings': ['College of Computer and Information, Shanghai Second Polytechnic University, P.R.China, 201209'], 'affiliations': [{'raw_affiliation_string': 'College of Computer and Information, Shanghai Second Polytechnic University, P.R.China, 201209', 'institution_ids': ['https://openalex.org/I135905480']}]}], 'institution_assertions': [], 'countries_distinct_count': 1, 'institutions_distinct_count': 2, 'corresponding_author_ids': [], 'corresponding_institution_ids': [], 'apc_list': None, 'apc_paid': None, 'fwci': 0.727, 'has_fulltext': True, 'fulltext_origin': 'ngrams', 'cited_by_count': 7, 'citation_normalized_percentile': {'value': 0.72621, 'is_in_top_1_percent': False, 'is_in_top_10_percent': False}, 'cited_by_percentile_year': {'min': 80, 'max': 81}, 'biblio': {'volume': None, 'issue': None, 'first_page': '381', 'last_page': '386'}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T10567', 'display_name': 'Vehicle Routing Optimization Methods', 'score': 0.9968, '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/T10567', 'display_name': 'Vehicle Routing Optimization Methods', 'score': 0.9968, '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/T11522', 'display_name': 'VLSI and FPGA Design Techniques', 'score': 0.995, 'subfield': {'id': 'https://openalex.org/subfields/2208', 'display_name': 'Electrical and Electronic 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/T12176', 'display_name': 'Optimization and Packing Problems', 'score': 0.9949, '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'}}], 'keywords': [{'id': 'https://openalex.org/keywords/reverse-delete-algorithm', 'display_name': 'Reverse-delete algorithm', 'score': 0.74750257}, {'id': 'https://openalex.org/keywords/prims-algorithm', 'display_name': "Prim's algorithm", 'score': 0.7224593}, {'id': 'https://openalex.org/keywords/degree', 'display_name': 'Degree (music)', 'score': 0.59305537}, {'id': 'https://openalex.org/keywords/k-minimum-spanning-tree', 'display_name': 'k-minimum spanning tree', 'score': 0.50573635}, {'id': 'https://openalex.org/keywords/connectivity', 'display_name': 'Connectivity', 'score': 0.48702842}, {'id': 'https://openalex.org/keywords/gomory–hu-tree', 'display_name': 'Gomory–Hu tree', 'score': 0.4541707}, {'id': 'https://openalex.org/keywords/tree', 'display_name': 'Tree (set theory)', 'score': 0.43830946}, {'id': 'https://openalex.org/keywords/connected-component', 'display_name': 'Connected component', 'score': 0.417377}], 'concepts': [{'id': 'https://openalex.org/C13743678', 'wikidata': 'https://www.wikidata.org/wiki/Q240464', 'display_name': 'Minimum spanning tree', 'level': 2, 'score': 0.8554684}, {'id': 'https://openalex.org/C65949645', 'wikidata': 'https://www.wikidata.org/wiki/Q5283163', 'display_name': 'Distributed minimum spanning tree', 'level': 3, 'score': 0.7924089}, {'id': 'https://openalex.org/C64331007', 'wikidata': 'https://www.wikidata.org/wiki/Q831672', 'display_name': 'Spanning tree', 'level': 2, 'score': 0.78929615}, {'id': 'https://openalex.org/C199346575', 'wikidata': 'https://www.wikidata.org/wiki/Q4925151', 'display_name': 'Reverse-delete algorithm', 'level': 4, 'score': 0.74750257}, {'id': 'https://openalex.org/C1649724', 'wikidata': 'https://www.wikidata.org/wiki/Q470813', 'display_name': "Prim's algorithm", 'level': 4, 'score': 0.7224593}, {'id': 'https://openalex.org/C63645285', 'wikidata': 'https://www.wikidata.org/wiki/Q797860', 'display_name': "Kruskal's algorithm", 'level': 3, 'score': 0.67319566}, {'id': 'https://openalex.org/C2775997480', 'wikidata': 'https://www.wikidata.org/wiki/Q586277', 'display_name': 'Degree (music)', 'level': 2, 'score': 0.59305537}, {'id': 'https://openalex.org/C132525143', 'wikidata': 'https://www.wikidata.org/wiki/Q141488', 'display_name': 'Graph', 'level': 2, 'score': 0.53377414}, {'id': 'https://openalex.org/C37810922', 'wikidata': 'https://www.wikidata.org/wiki/Q5161409', 'display_name': 'Connected dominating set', 'level': 3, 'score': 0.52878034}, {'id': 'https://openalex.org/C202750272', 'wikidata': 'https://www.wikidata.org/wiki/Q6322849', 'display_name': 'k-minimum spanning tree', 'level': 5, 'score': 0.50573635}, {'id': 'https://openalex.org/C76444178', 'wikidata': 'https://www.wikidata.org/wiki/Q72897900', 'display_name': 'Connectivity', 'level': 3, 'score': 0.48702842}, {'id': 'https://openalex.org/C147517495', 'wikidata': 'https://www.wikidata.org/wiki/Q5581241', 'display_name': 'Gomory–Hu tree', 'level': 5, 'score': 0.4541707}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.44477814}, {'id': 'https://openalex.org/C113174947', 'wikidata': 'https://www.wikidata.org/wiki/Q2859736', 'display_name': 'Tree (set theory)', 'level': 2, 'score': 0.43830946}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.4350962}, {'id': 'https://openalex.org/C145685049', 'wikidata': 'https://www.wikidata.org/wiki/Q4454941', 'display_name': 'Euclidean minimum spanning tree', 'level': 4, 'score': 0.43090656}, {'id': 'https://openalex.org/C193435613', 'wikidata': 'https://www.wikidata.org/wiki/Q2997928', 'display_name': 'Connected component', 'level': 2, 'score': 0.417377}, {'id': 'https://openalex.org/C11413529', 'wikidata': 'https://www.wikidata.org/wiki/Q8366', 'display_name': 'Algorithm', 'level': 1, 'score': 0.39949885}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.3363785}, {'id': 'https://openalex.org/C100560664', 'wikidata': 'https://www.wikidata.org/wiki/Q3608019', 'display_name': 'K-ary tree', 'level': 4, 'score': 0.28916448}, {'id': 'https://openalex.org/C163797641', 'wikidata': 'https://www.wikidata.org/wiki/Q2067937', 'display_name': 'Tree structure', 'level': 3, 'score': 0.22878271}, {'id': 'https://openalex.org/C197855036', 'wikidata': 'https://www.wikidata.org/wiki/Q380172', 'display_name': 'Binary tree', 'level': 2, 'score': 0.10851455}, {'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': 'https://doi.org/10.1109/icmse.2007.4421877', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S4306419651', 'display_name': 'International Conference on Management Science and Engineering', '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': 14, 'referenced_works': ['https://openalex.org/W1948148225', 'https://openalex.org/W1971782520', 'https://openalex.org/W1995670816', 'https://openalex.org/W1996106387', 'https://openalex.org/W2017927472', 'https://openalex.org/W2029403470', 'https://openalex.org/W2034840381', 'https://openalex.org/W2063193808', 'https://openalex.org/W2069323107', 'https://openalex.org/W2087216833', 'https://openalex.org/W2138304862', 'https://openalex.org/W2148673189', 'https://openalex.org/W2161880126', 'https://openalex.org/W4255306344'], 'related_works': ['https://openalex.org/W3081212354', 'https://openalex.org/W3016811403', 'https://openalex.org/W2943635264', 'https://openalex.org/W2518240130', 'https://openalex.org/W2390742649', 'https://openalex.org/W2361573941', 'https://openalex.org/W2353822696', 'https://openalex.org/W2281826919', 'https://openalex.org/W2130375301', 'https://openalex.org/W1576317141'], 'abstract_inverted_index': {'The': [0, 37], 'minimum': [1, 39], 'spanning': [2, 40, 63], 'tree': [3, 41, 64, 135], '(MST)': [4], 'of': [5, 12, 47, 60, 104, 113, 140, 166], 'a': [6, 24, 44, 62, 70, 92, 128, 134, 143], 'graph': [7, 17, 126], 'defines': [8], 'the': [9, 16, 86, 99, 102, 105, 109, 117, 131, 138, 151, 161, 164, 167], 'cheapest': [10], 'subset': [11], 'edges': [13, 122], 'that': [14, 84], 'keeps': [15], 'in': [18, 27, 34, 55, 127], 'one': [19], 'connected': [20], 'component': [21], 'which': [22, 49], 'is': [23, 43, 50, 79, 82, 88], 'classic': [25], 'problem': [26, 54, 106], 'operational': [28], 'research': [29], '(OR)': [30], 'with': [31], 'important': [32, 53], 'applications': [33], 'network': [35, 56], 'design.': [36, 57], 'degree-constrained': [38], '(DCMST)': [42], 'special': [45], 'case': [46], 'MST,': [48], 'also': [51, 155], 'an': [52, 124, 157], 'It': [58, 81], 'consists': [59], 'finding': [61], 'whose': [65, 75], 'nodes': [66], 'do': [67], 'not': [68], 'exceed': [69], 'given': [71], 'maximum': [72], 'degree': [73, 114], 'and': [74, 163], 'total': [76], 'edge': [77], 'length': [78], 'minimum.': [80], 'known': [83], 'computing': [85], 'DCMST': [87], 'NP-hard.': [89], 'We': [90], 'design': [91], 'new': [93], 'algorithm': [94, 100, 132], 'for': [95], 'DCMST.': [96, 141], 'At': [97], 'first,': [98], 'employs': [101], 'properties': [103], 'to': [107, 123, 159], 'remove': [108], 'pendant': [110], 'vertexes': [111], '(vertexes': [112], '1)': [115], 'from': [116], 'graph.': [118], 'Then': [119], 'by': [120, 149], 'adding': [121], 'empty': [125], 'setting': [129], 'order,': [130], 'gets': [133], 'satisfying': [136], 'all': [137], 'constraints': [139], 'Finally,': [142], 'better': [144], 'solution': [145], 'comes': [146], 'into': [147], 'being': [148], 'swapping': [150], 'edges.': [152], 'This': [153], 'paper': [154], 'gives': [156], 'example': [158], 'demonstrate': [160], 'principle': [162], 'process': [165], 'algorithm.': [168]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W1973100174', 'counts_by_year': [{'year': 2017, 'cited_by_count': 2}, {'year': 2013, 'cited_by_count': 1}, {'year': 2012, 'cited_by_count': 2}], 'updated_date': '2024-12-10T10:00:35.238210', 'created_date': '2016-06-24'}