Publication Information

{'id': 'https://openalex.org/W3116169590', 'doi': 'https://doi.org/10.37082/ijirmps.2020.v08i03.005', 'title': 'Matrix Method for Determining Minimum Spanning Tree', 'display_name': 'Matrix Method for Determining Minimum Spanning Tree', 'publication_year': 2020, 'publication_date': '2020-06-28', 'ids': {'openalex': 'https://openalex.org/W3116169590', 'doi': 'https://doi.org/10.37082/ijirmps.2020.v08i03.005', 'mag': '3116169590'}, 'language': 'en', 'primary_location': {'is_oa': True, 'landing_page_url': 'https://doi.org/10.37082/ijirmps.2020.v08i03.005', 'pdf_url': 'https://www.ijirmps.org/papers/2020/3/812.pdf', 'source': {'id': 'https://openalex.org/S4210226059', 'display_name': 'International Journal of Innovative Research in Engineering & Multidisciplinary Physical Sciences', 'issn_l': '2349-7300', 'issn': ['2349-7300'], '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': 'journal'}, 'license': 'cc-by-sa', 'license_id': 'https://openalex.org/licenses/cc-by-sa', 'version': 'publishedVersion', 'is_accepted': True, 'is_published': True}, 'type': 'article', 'type_crossref': 'journal-article', 'indexed_in': ['crossref'], 'open_access': {'is_oa': True, 'oa_status': 'hybrid', 'oa_url': 'https://www.ijirmps.org/papers/2020/3/812.pdf', 'any_repository_has_fulltext': True}, 'authorships': [{'author_position': 'first', 'author': {'id': 'https://openalex.org/A5074580445', 'display_name': 'Farhan Banu', 'orcid': None}, 'institutions': [], 'countries': [], 'is_corresponding': True, 'raw_author_name': 'Farhan Banu', 'raw_affiliation_strings': [], 'affiliations': []}], 'institution_assertions': [], 'countries_distinct_count': 0, 'institutions_distinct_count': 0, 'corresponding_author_ids': ['https://openalex.org/A5074580445'], 'corresponding_institution_ids': [], 'apc_list': None, 'apc_paid': None, 'fwci': 0.0, 'has_fulltext': True, 'fulltext_origin': 'pdf', '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': 61}, 'biblio': {'volume': '8', 'issue': '3', 'first_page': '29', 'last_page': '33'}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T11522', 'display_name': 'VLSI and FPGA Design Techniques', 'score': 0.9739, '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/T11522', 'display_name': 'VLSI and FPGA Design Techniques', 'score': 0.9739, '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/T10847', 'display_name': 'Advanced Optical Network Technologies', 'score': 0.9306, '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/k-minimum-spanning-tree', 'display_name': 'k-minimum spanning tree', 'score': 0.5439846}, {'id': 'https://openalex.org/keywords/tree', 'display_name': 'Tree (set theory)', 'score': 0.4745584}, {'id': 'https://openalex.org/keywords/prims-algorithm', 'display_name': "Prim's algorithm", 'score': 0.45093712}, {'id': 'https://openalex.org/keywords/matrix', 'display_name': 'Matrix (chemical analysis)', 'score': 0.4270826}], 'concepts': [{'id': 'https://openalex.org/C64331007', 'wikidata': 'https://www.wikidata.org/wiki/Q831672', 'display_name': 'Spanning tree', 'level': 2, 'score': 0.9303194}, {'id': 'https://openalex.org/C13743678', 'wikidata': 'https://www.wikidata.org/wiki/Q240464', 'display_name': 'Minimum spanning tree', 'level': 2, 'score': 0.89388186}, {'id': 'https://openalex.org/C65949645', 'wikidata': 'https://www.wikidata.org/wiki/Q5283163', 'display_name': 'Distributed minimum spanning tree', 'level': 3, 'score': 0.78310955}, {'id': 'https://openalex.org/C145685049', 'wikidata': 'https://www.wikidata.org/wiki/Q4454941', 'display_name': 'Euclidean minimum spanning tree', 'level': 4, 'score': 0.7277988}, {'id': 'https://openalex.org/C37810922', 'wikidata': 'https://www.wikidata.org/wiki/Q5161409', 'display_name': 'Connected dominating set', 'level': 3, 'score': 0.63564575}, {'id': 'https://openalex.org/C63645285', 'wikidata': 'https://www.wikidata.org/wiki/Q797860', 'display_name': "Kruskal's algorithm", 'level': 3, 'score': 0.5640687}, {'id': 'https://openalex.org/C202750272', 'wikidata': 'https://www.wikidata.org/wiki/Q6322849', 'display_name': 'k-minimum spanning tree', 'level': 5, 'score': 0.5439846}, {'id': 'https://openalex.org/C64271015', 'wikidata': 'https://www.wikidata.org/wiki/Q6865444', 'display_name': 'Minimum degree spanning tree', 'level': 3, 'score': 0.47640052}, {'id': 'https://openalex.org/C113174947', 'wikidata': 'https://www.wikidata.org/wiki/Q2859736', 'display_name': 'Tree (set theory)', 'level': 2, 'score': 0.4745584}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.47320932}, {'id': 'https://openalex.org/C1649724', 'wikidata': 'https://www.wikidata.org/wiki/Q470813', 'display_name': "Prim's algorithm", 'level': 4, 'score': 0.45093712}, {'id': 'https://openalex.org/C23394520', 'wikidata': 'https://www.wikidata.org/wiki/Q4919350', 'display_name': 'Shortest-path tree', 'level': 3, 'score': 0.44998786}, {'id': 'https://openalex.org/C106487976', 'wikidata': 'https://www.wikidata.org/wiki/Q685816', 'display_name': 'Matrix (chemical analysis)', 'level': 2, 'score': 0.4270826}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.4225042}, {'id': 'https://openalex.org/C126255220', 'wikidata': 'https://www.wikidata.org/wiki/Q141495', 'display_name': 'Mathematical optimization', 'level': 1, 'score': 0.37061128}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.35958484}, {'id': 'https://openalex.org/C100560664', 'wikidata': 'https://www.wikidata.org/wiki/Q3608019', 'display_name': 'K-ary tree', 'level': 4, 'score': 0.24984369}, {'id': 'https://openalex.org/C163797641', 'wikidata': 'https://www.wikidata.org/wiki/Q2067937', 'display_name': 'Tree structure', 'level': 3, 'score': 0.19999251}, {'id': 'https://openalex.org/C197855036', 'wikidata': 'https://www.wikidata.org/wiki/Q380172', 'display_name': 'Binary tree', 'level': 2, 'score': 0.13361591}, {'id': 'https://openalex.org/C192562407', 'wikidata': 'https://www.wikidata.org/wiki/Q228736', 'display_name': 'Materials science', 'level': 0, 'score': 0.0}, {'id': 'https://openalex.org/C159985019', 'wikidata': 'https://www.wikidata.org/wiki/Q181790', 'display_name': 'Composite material', 'level': 1, 'score': 0.0}], 'mesh': [], 'locations_count': 2, 'locations': [{'is_oa': True, 'landing_page_url': 'https://doi.org/10.37082/ijirmps.2020.v08i03.005', 'pdf_url': 'https://www.ijirmps.org/papers/2020/3/812.pdf', 'source': {'id': 'https://openalex.org/S4210226059', 'display_name': 'International Journal of Innovative Research in Engineering & Multidisciplinary Physical Sciences', 'issn_l': '2349-7300', 'issn': ['2349-7300'], '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': 'journal'}, 'license': 'cc-by-sa', 'license_id': 'https://openalex.org/licenses/cc-by-sa', 'version': 'publishedVersion', 'is_accepted': True, 'is_published': True}, {'is_oa': True, 'landing_page_url': 'https://zenodo.org/record/4276509', 'pdf_url': 'https://zenodo.org/records/4276509/files/812.pdf', 'source': {'id': 'https://openalex.org/S4306400562', 'display_name': 'Zenodo (CERN European Organization for Nuclear Research)', 'issn_l': None, 'issn': None, 'is_oa': True, 'is_in_doaj': False, 'is_core': False, 'host_organization': 'https://openalex.org/I67311998', 'host_organization_name': 'European Organization for Nuclear Research', 'host_organization_lineage': ['https://openalex.org/I67311998'], 'host_organization_lineage_names': ['European Organization for Nuclear Research'], 'type': 'repository'}, 'license': 'cc-by', 'license_id': 'https://openalex.org/licenses/cc-by', 'version': 'submittedVersion', 'is_accepted': False, 'is_published': False}], 'best_oa_location': {'is_oa': True, 'landing_page_url': 'https://doi.org/10.37082/ijirmps.2020.v08i03.005', 'pdf_url': 'https://www.ijirmps.org/papers/2020/3/812.pdf', 'source': {'id': 'https://openalex.org/S4210226059', 'display_name': 'International Journal of Innovative Research in Engineering & Multidisciplinary Physical Sciences', 'issn_l': '2349-7300', 'issn': ['2349-7300'], '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': 'journal'}, 'license': 'cc-by-sa', 'license_id': 'https://openalex.org/licenses/cc-by-sa', 'version': 'publishedVersion', 'is_accepted': True, 'is_published': True}, 'sustainable_development_goals': [], 'grants': [], 'datasets': [], 'versions': [], 'referenced_works_count': 5, 'referenced_works': ['https://openalex.org/W1586030997', 'https://openalex.org/W1965680834', 'https://openalex.org/W2017927472', 'https://openalex.org/W2026513874', 'https://openalex.org/W2119546824'], 'related_works': ['https://openalex.org/W3081212354', 'https://openalex.org/W3016811403', 'https://openalex.org/W2943635264', 'https://openalex.org/W2387385213', 'https://openalex.org/W2149927264', 'https://openalex.org/W2059360098', 'https://openalex.org/W2048177396', 'https://openalex.org/W1983511657', 'https://openalex.org/W1587959445', 'https://openalex.org/W1576317141'], 'abstract_inverted_index': {'This': [0], 'paper': [1], 'is': [2, 33], 'concerned': [3], 'with': [4, 36], 'Minimum': [5], 'Spanning': [6], 'Tree': [7], 'problem,': [8], 'a': [9, 19], 'fundamental': [10], 'problem': [11], 'of': [12, 27], 'Network': [13], 'modeling.': [14], 'Here': [15], 'we': [16], 'have': [17], 'proposed': [18], 'novel': [20], 'approach': [21], 'to': [22], 'determine': [23], 'minimum': [24], 'spanning': [25], 'tree': [26], 'an': [28], 'undirected': [29], 'connected': [30], 'network': [31], 'which': [32], 'also': [34], 'demonstrated': [35], 'numerical': [37], 'example': [38]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W3116169590', 'counts_by_year': [], 'updated_date': '2024-12-14T07:11:17.847933', 'created_date': '2021-01-05'}