Publication Information

{'id': 'https://openalex.org/W3007799401', 'doi': 'https://doi.org/10.14801/jkiit.2015.13.10.119', 'title': 'A Simple Degree-Constrained Minimum Spanning Tree Algorithm', 'display_name': 'A Simple Degree-Constrained Minimum Spanning Tree Algorithm', 'publication_year': 2015, 'publication_date': '2015-01-31', 'ids': {'openalex': 'https://openalex.org/W3007799401', 'doi': 'https://doi.org/10.14801/jkiit.2015.13.10.119', 'mag': '3007799401'}, 'language': 'ko', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://doi.org/10.14801/jkiit.2015.13.10.119', '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': 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': 66}, 'biblio': {'volume': '13', 'issue': '10', 'first_page': '119', 'last_page': '119'}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T10847', 'display_name': 'Advanced Optical Network Technologies', 'score': 0.9922, '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'}}, 'topics': [{'id': 'https://openalex.org/T10847', 'display_name': 'Advanced Optical Network Technologies', 'score': 0.9922, '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/T11429', 'display_name': 'Semiconductor Lasers and Optical Devices', 'score': 0.9866, '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/T10232', 'display_name': 'Optical Network Technologies', 'score': 0.984, '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'}}], 'keywords': [{'id': 'https://openalex.org/keywords/degree', 'display_name': 'Degree (music)', 'score': 0.5971521}, {'id': 'https://openalex.org/keywords/tree', 'display_name': 'Tree (set theory)', 'score': 0.41892394}], 'concepts': [{'id': 'https://openalex.org/C13743678', 'wikidata': 'https://www.wikidata.org/wiki/Q240464', 'display_name': 'Minimum spanning tree', 'level': 2, 'score': 0.77221143}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.69070476}, {'id': 'https://openalex.org/C64331007', 'wikidata': 'https://www.wikidata.org/wiki/Q831672', 'display_name': 'Spanning tree', 'level': 2, 'score': 0.6141262}, {'id': 'https://openalex.org/C2775997480', 'wikidata': 'https://www.wikidata.org/wiki/Q586277', 'display_name': 'Degree (music)', 'level': 2, 'score': 0.5971521}, {'id': 'https://openalex.org/C2780586882', 'wikidata': 'https://www.wikidata.org/wiki/Q7520643', 'display_name': 'Simple (philosophy)', 'level': 2, 'score': 0.5771137}, {'id': 'https://openalex.org/C64271015', 'wikidata': 'https://www.wikidata.org/wiki/Q6865444', 'display_name': 'Minimum degree spanning tree', 'level': 3, 'score': 0.53498334}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.51049507}, {'id': 'https://openalex.org/C65949645', 'wikidata': 'https://www.wikidata.org/wiki/Q5283163', 'display_name': 'Distributed minimum spanning tree', 'level': 3, 'score': 0.5019796}, {'id': 'https://openalex.org/C63645285', 'wikidata': 'https://www.wikidata.org/wiki/Q797860', 'display_name': "Kruskal's algorithm", 'level': 3, 'score': 0.49786806}, {'id': 'https://openalex.org/C113174947', 'wikidata': 'https://www.wikidata.org/wiki/Q2859736', 'display_name': 'Tree (set theory)', 'level': 2, 'score': 0.41892394}, {'id': 'https://openalex.org/C11413529', 'wikidata': 'https://www.wikidata.org/wiki/Q8366', 'display_name': 'Algorithm', 'level': 1, 'score': 0.38496727}, {'id': 'https://openalex.org/C121332964', 'wikidata': 'https://www.wikidata.org/wiki/Q413', 'display_name': 'Physics', 'level': 0, 'score': 0.24052784}, {'id': 'https://openalex.org/C138885662', 'wikidata': 'https://www.wikidata.org/wiki/Q5891', 'display_name': 'Philosophy', 'level': 0, 'score': 0.0}, {'id': 'https://openalex.org/C111472728', 'wikidata': 'https://www.wikidata.org/wiki/Q9471', 'display_name': 'Epistemology', 'level': 1, '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.14801/jkiit.2015.13.10.119', '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/W2418231958', 'https://openalex.org/W2387385213', 'https://openalex.org/W2138987445', 'https://openalex.org/W2130375301', 'https://openalex.org/W2099915933', 'https://openalex.org/W2074214908', 'https://openalex.org/W2015718828'], 'abstract_inverted_index': {'차수제약': [0], '최소신장트리(DCMST)': [1], '문제는': [2], 'MST의': [3], '특수한': [4], '경우로,': [5], '망': [6], '설계에': [7], '있어': [8], '중요한': [9], '문제이다.': [10], 'DCMST는': [11, 46, 51, 66], '정확한': [12], '해를': [13, 28, 81], '구하는': [14, 41], '다항시간': [15], '알고리즘이': [16], '존재하지': [17], '않아': [18], 'NP-완전': [19], '문제로': [20], '알려져': [21], '왔다.': [22], '따라서': [23], '메타휴리스틱': [24], '기법을': [25, 59, 68], '적용하여': [26], '근사': [27], '구하고': [29], '있다.': [30], '본': [31], '논문에서는': [32], '차수': [33], '범위': [34], 'dSUBL/SUB≤': [35], 'd≤': [36], 'dSUBH/SUB': [37, 45], '의': [38], 'DCMST를': [39], '다항시간으로': [40], '휴리스틱': [42], '알고리즘을': [43, 71], '제안하였다.': [44], 'MST로': [47], '결정하였으며,': [48], '3≤': [49], 'd≤dSUBH/SUB-1\ue034의': [50], 'MST로부터': [52], '차수를': [53], '1개씩': [54], '점진적으로': [55], '감소시키는': [56], '1-opt': [57], '간선교환': [58], '적용하였다.': [60, 69], '또한,': [61], 'dSUBL/SUB=2': [62], '인': [63], '해밀턴': [64], '경로': [65], 'k-opt(k=1,2,3)': [67], '제안된': [70], '8개의': [72], 'SHRD': [73], '벤치마킹': [74], '데이터에': [75], '적용한': [76], '결과': [77], '기존에': [78], '알려진': [79], '최적': [80], '크게': [82], '감소시켰다.': [83]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W3007799401', 'counts_by_year': [], 'updated_date': '2024-12-24T07:27:28.788114', 'created_date': '2020-03-06'}