Publication Information

{'id': 'https://openalex.org/W2332776364', 'doi': 'https://doi.org/10.14801/kiitr.2014.12.7.155', 'title': 'A Hybrid Algorithm for Degree-Constrained Minimum Spanning Tree', 'display_name': 'A Hybrid Algorithm for Degree-Constrained Minimum Spanning Tree', 'publication_year': 2014, 'publication_date': '2014-07-31', 'ids': {'openalex': 'https://openalex.org/W2332776364', 'doi': 'https://doi.org/10.14801/kiitr.2014.12.7.155', 'mag': '2332776364'}, 'language': 'ko', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://doi.org/10.14801/kiitr.2014.12.7.155', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S4210201406', 'display_name': 'The Journal of Korean Institute of Information Technology', 'issn_l': '1598-8619', 'issn': ['1598-8619', '2093-7571'], 'is_oa': False, 'is_in_doaj': False, 'is_core': False, 'host_organization': 'https://openalex.org/P4310315235', 'host_organization_name': 'Indonesian Institute of Information Technology', 'host_organization_lineage': ['https://openalex.org/P4310315235'], 'host_organization_lineage_names': ['Indonesian Institute of Information Technology'], 'type': 'journal'}, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}, 'type': 'article', 'type_crossref': 'journal-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/A5024139086', 'display_name': 'Sang-Un Lee', 'orcid': None}, 'institutions': [], 'countries': [], 'is_corresponding': True, 'raw_author_name': 'Sang-Un Lee', 'raw_affiliation_strings': [], 'affiliations': []}], 'institution_assertions': [], 'countries_distinct_count': 0, 'institutions_distinct_count': 0, 'corresponding_author_ids': ['https://openalex.org/A5024139086'], 'corresponding_institution_ids': [], 'apc_list': None, 'apc_paid': None, 'fwci': 0.0, 'has_fulltext': False, 'cited_by_count': 1, 'citation_normalized_percentile': {'value': 0.559445, 'is_in_top_1_percent': False, 'is_in_top_10_percent': False}, 'cited_by_percentile_year': {'min': 66, 'max': 73}, 'biblio': {'volume': '12', 'issue': '7', 'first_page': None, 'last_page': None}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T10715', 'display_name': 'Distributed and Parallel Computing Systems', 'score': 0.9854, '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'}}, 'topics': [{'id': 'https://openalex.org/T10715', 'display_name': 'Distributed and Parallel Computing Systems', 'score': 0.9854, '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/T12288', 'display_name': 'Optimization and Search Problems', 'score': 0.9848, '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/T12203', 'display_name': 'Mobile Agent-Based Network Management', 'score': 0.9805, '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/degree', 'display_name': 'Degree (music)', 'score': 0.5840323}], 'concepts': [{'id': 'https://openalex.org/C13743678', 'wikidata': 'https://www.wikidata.org/wiki/Q240464', 'display_name': 'Minimum spanning tree', 'level': 2, 'score': 0.89242446}, {'id': 'https://openalex.org/C63645285', 'wikidata': 'https://www.wikidata.org/wiki/Q797860', 'display_name': "Kruskal's algorithm", 'level': 3, 'score': 0.8654722}, {'id': 'https://openalex.org/C64331007', 'wikidata': 'https://www.wikidata.org/wiki/Q831672', 'display_name': 'Spanning tree', 'level': 2, 'score': 0.6927569}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.68176544}, {'id': 'https://openalex.org/C65949645', 'wikidata': 'https://www.wikidata.org/wiki/Q5283163', 'display_name': 'Distributed minimum spanning tree', 'level': 3, 'score': 0.6277063}, {'id': 'https://openalex.org/C2775997480', 'wikidata': 'https://www.wikidata.org/wiki/Q586277', 'display_name': 'Degree (music)', 'level': 2, 'score': 0.5840323}, {'id': 'https://openalex.org/C64271015', 'wikidata': 'https://www.wikidata.org/wiki/Q6865444', 'display_name': 'Minimum degree spanning tree', 'level': 3, 'score': 0.5662727}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.49681547}, {'id': 'https://openalex.org/C37810922', 'wikidata': 'https://www.wikidata.org/wiki/Q5161409', 'display_name': 'Connected dominating set', 'level': 3, 'score': 0.43441513}, {'id': 'https://openalex.org/C121332964', 'wikidata': 'https://www.wikidata.org/wiki/Q413', 'display_name': 'Physics', 'level': 0, 'score': 0.21127105}, {'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.14801/kiitr.2014.12.7.155', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S4210201406', 'display_name': 'The Journal of Korean Institute of Information Technology', 'issn_l': '1598-8619', 'issn': ['1598-8619', '2093-7571'], 'is_oa': False, 'is_in_doaj': False, 'is_core': False, 'host_organization': 'https://openalex.org/P4310315235', 'host_organization_name': 'Indonesian Institute of Information Technology', 'host_organization_lineage': ['https://openalex.org/P4310315235'], 'host_organization_lineage_names': ['Indonesian Institute of Information 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/W4380840098', 'https://openalex.org/W4242086819', 'https://openalex.org/W3016811403', 'https://openalex.org/W2943635264', 'https://openalex.org/W2589768050', 'https://openalex.org/W2387385213', 'https://openalex.org/W2138987445', 'https://openalex.org/W2099915933', 'https://openalex.org/W2074214908', 'https://openalex.org/W1569529368'], 'abstract_inverted_index': {'무방향': [0], '가중': [1], '그래프의': [2], '차수제약': [3], '최소신장트리': [4], '(d-MST)': [5], '문제는': [6], '정확한': [7], '해를': [8, 23, 88], '구하는': [9, 33, 48], '다항시간': [10, 49], '알고리즘이': [11], '존재하지': [12], '않아': [13], 'NP-완전': [14, 95], '문제로': [15], '알려져': [16], '왔다.': [17], '따라서': [18, 91], '근사': [19], '알고리즘을': [20, 50, 78], '적용하여': [21], '최적': [22, 87], '구하고': [24], '있다.': [25], '본': [26], '논문은': [27], '차수를': [28, 39, 52], '제약하지': [29], '않는': [30], '일반적인': [31], '최소신장트리를': [32], 'Bor?vka와': [34], 'Kruskal': [35], '알고리즘으로': [36], 'MST를': [37], '구하고,': [38], '1씩': [40], '줄여': [41], '가면서': [42], '해밀턴': [43], '경로인': [44], '2-MST': [45], '까지': [46], '정확히': [47, 84], '제안하였다.': [51], '교환하는': [53, 74], '방법은': [54], '주어진': [55], 'MST에서': [56], '차수': [57], 'deg(v)': [58, 69], '>': [59], 'd인': [60], '정점의': [61], '최대': [62], '가중치': [63], '간선을': [64], '제거하고': [65], '가중치를': [66], '최소로': [67], '증가시키면서': [68], '≤': [70], 'd가': [71], '되는': [72], '간선으로': [73], '방법을': [75], '적용하였다.': [76], '제안된': [77], '3개의': [79], '그래프에': [80], '적용한': [81], '결과': [82], '모두': [83], '2-MST까지': [85], '쉽게': [86], '구하는데': [89], '성공하였다.': [90], 'd-MST는': [92], '더': [93], '이상': [94], '문제가': [96], '아니며,': [97], 'P-문제임을': [98], '보였다.': [99]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W2332776364', 'counts_by_year': [{'year': 2022, 'cited_by_count': 1}], 'updated_date': '2024-12-24T12:45:41.267630', 'created_date': '2016-06-24'}