Publication Information

{'id': 'https://openalex.org/W1593284275', 'doi': 'https://doi.org/10.1109/icacea.2015.7164769', 'title': 'Determining minimum spanning tree in an undirected weighted graph', 'display_name': 'Determining minimum spanning tree in an undirected weighted graph', 'publication_year': 2015, 'publication_date': '2015-03-01', 'ids': {'openalex': 'https://openalex.org/W1593284275', 'doi': 'https://doi.org/10.1109/icacea.2015.7164769', 'mag': '1593284275'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://doi.org/10.1109/icacea.2015.7164769', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S4306419111', 'display_name': 'International Conference on Advances in Computer Engineering and Applications', '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/A5068978125', 'display_name': 'Shikha Rai', 'orcid': 'https://orcid.org/0000-0002-9621-8893'}, 'institutions': [], 'countries': ['IN'], 'is_corresponding': False, 'raw_author_name': 'Shikha Rai', 'raw_affiliation_strings': ['MIET, Meerut, India'], 'affiliations': [{'raw_affiliation_string': 'MIET, Meerut, India', 'institution_ids': []}]}, {'author_position': 'last', 'author': {'id': 'https://openalex.org/A5057454224', 'display_name': 'Swati Sharma', 'orcid': 'https://orcid.org/0000-0002-5595-6574'}, 'institutions': [], 'countries': ['IN'], 'is_corresponding': False, 'raw_author_name': 'Swati Sharma', 'raw_affiliation_strings': ['Department of IT, MIET, Meerut, India'], 'affiliations': [{'raw_affiliation_string': 'Department of IT, MIET, Meerut, India', 'institution_ids': []}]}], 'institution_assertions': [], 'countries_distinct_count': 1, 'institutions_distinct_count': 0, 'corresponding_author_ids': [], 'corresponding_institution_ids': [], 'apc_list': None, 'apc_paid': None, 'fwci': 2.501, 'has_fulltext': True, 'fulltext_origin': 'ngrams', 'cited_by_count': 7, 'citation_normalized_percentile': {'value': 0.827689, 'is_in_top_1_percent': False, 'is_in_top_10_percent': False}, 'cited_by_percentile_year': {'min': 83, 'max': 84}, 'biblio': {'volume': None, 'issue': None, 'first_page': '637', 'last_page': '642'}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T14304', 'display_name': 'Transport Systems and Technology', 'score': 0.9918, 'subfield': {'id': 'https://openalex.org/subfields/2210', 'display_name': 'Mechanical 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/T14304', 'display_name': 'Transport Systems and Technology', 'score': 0.9918, 'subfield': {'id': 'https://openalex.org/subfields/2210', 'display_name': 'Mechanical 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/T11106', 'display_name': 'Data Management and Algorithms', 'score': 0.9774, 'subfield': {'id': 'https://openalex.org/subfields/1711', 'display_name': 'Signal Processing'}, '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/T12546', 'display_name': 'Smart Parking Systems Research', 'score': 0.9712, 'subfield': {'id': 'https://openalex.org/subfields/2215', 'display_name': 'Building and Construction'}, '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.74505615}, {'id': 'https://openalex.org/keywords/trémaux-tree', 'display_name': 'Trémaux tree', 'score': 0.58952135}, {'id': 'https://openalex.org/keywords/prims-algorithm', 'display_name': "Prim's algorithm", 'score': 0.5891678}, {'id': 'https://openalex.org/keywords/cycle-basis', 'display_name': 'Cycle basis', 'score': 0.5346595}, {'id': 'https://openalex.org/keywords/butterfly-graph', 'display_name': 'Butterfly graph', 'score': 0.5177581}, {'id': 'https://openalex.org/keywords/gomory–hu-tree', 'display_name': 'Gomory–Hu tree', 'score': 0.42930484}], 'concepts': [{'id': 'https://openalex.org/C13743678', 'wikidata': 'https://www.wikidata.org/wiki/Q240464', 'display_name': 'Minimum spanning tree', 'level': 2, 'score': 0.8027276}, {'id': 'https://openalex.org/C64331007', 'wikidata': 'https://www.wikidata.org/wiki/Q831672', 'display_name': 'Spanning tree', 'level': 2, 'score': 0.77172124}, {'id': 'https://openalex.org/C199346575', 'wikidata': 'https://www.wikidata.org/wiki/Q4925151', 'display_name': 'Reverse-delete algorithm', 'level': 4, 'score': 0.74505615}, {'id': 'https://openalex.org/C63645285', 'wikidata': 'https://www.wikidata.org/wiki/Q797860', 'display_name': "Kruskal's algorithm", 'level': 3, 'score': 0.6842465}, {'id': 'https://openalex.org/C124302570', 'wikidata': 'https://www.wikidata.org/wiki/Q7849146', 'display_name': 'Trémaux tree', 'level': 5, 'score': 0.58952135}, {'id': 'https://openalex.org/C1649724', 'wikidata': 'https://www.wikidata.org/wiki/Q470813', 'display_name': "Prim's algorithm", 'level': 4, 'score': 0.5891678}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.5822584}, {'id': 'https://openalex.org/C145685049', 'wikidata': 'https://www.wikidata.org/wiki/Q4454941', 'display_name': 'Euclidean minimum spanning tree', 'level': 4, 'score': 0.54742175}, {'id': 'https://openalex.org/C37810922', 'wikidata': 'https://www.wikidata.org/wiki/Q5161409', 'display_name': 'Connected dominating set', 'level': 3, 'score': 0.54658526}, {'id': 'https://openalex.org/C26752605', 'wikidata': 'https://www.wikidata.org/wiki/Q16766188', 'display_name': 'Cycle basis', 'level': 5, 'score': 0.5346595}, {'id': 'https://openalex.org/C23394520', 'wikidata': 'https://www.wikidata.org/wiki/Q4919350', 'display_name': 'Shortest-path tree', 'level': 3, 'score': 0.5337556}, {'id': 'https://openalex.org/C18819970', 'wikidata': 'https://www.wikidata.org/wiki/Q3035340', 'display_name': 'Butterfly graph', 'level': 5, 'score': 0.5177581}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.5040847}, {'id': 'https://openalex.org/C19332903', 'wikidata': 'https://www.wikidata.org/wiki/Q7623247', 'display_name': 'Strength of a graph', 'level': 5, 'score': 0.4870532}, {'id': 'https://openalex.org/C147517495', 'wikidata': 'https://www.wikidata.org/wiki/Q5581241', 'display_name': 'Gomory–Hu tree', 'level': 5, 'score': 0.42930484}, {'id': 'https://openalex.org/C65949645', 'wikidata': 'https://www.wikidata.org/wiki/Q5283163', 'display_name': 'Distributed minimum spanning tree', 'level': 3, 'score': 0.42869768}, {'id': 'https://openalex.org/C132525143', 'wikidata': 'https://www.wikidata.org/wiki/Q141488', 'display_name': 'Graph', 'level': 2, 'score': 0.4252327}, {'id': 'https://openalex.org/C149530733', 'wikidata': 'https://www.wikidata.org/wiki/Q5597091', 'display_name': 'Graph power', 'level': 4, 'score': 0.42064494}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.4093958}, {'id': 'https://openalex.org/C203776342', 'wikidata': 'https://www.wikidata.org/wiki/Q1378376', 'display_name': 'Line graph', 'level': 3, 'score': 0.3982517}, {'id': 'https://openalex.org/C100560664', 'wikidata': 'https://www.wikidata.org/wiki/Q3608019', 'display_name': 'K-ary tree', 'level': 4, 'score': 0.38082504}, {'id': 'https://openalex.org/C22149727', 'wikidata': 'https://www.wikidata.org/wiki/Q7940747', 'display_name': 'Voltage graph', 'level': 4, 'score': 0.33429503}, {'id': 'https://openalex.org/C163797641', 'wikidata': 'https://www.wikidata.org/wiki/Q2067937', 'display_name': 'Tree structure', 'level': 3, 'score': 0.1686587}, {'id': 'https://openalex.org/C197855036', 'wikidata': 'https://www.wikidata.org/wiki/Q380172', 'display_name': 'Binary tree', 'level': 2, 'score': 0.09484041}, {'id': 'https://openalex.org/C43517604', 'wikidata': 'https://www.wikidata.org/wiki/Q7144893', 'display_name': 'Pathwidth', 'level': 4, 'score': 0.083307594}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'https://doi.org/10.1109/icacea.2015.7164769', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S4306419111', 'display_name': 'International Conference on Advances in Computer Engineering and Applications', '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': 2, 'referenced_works': ['https://openalex.org/W1965680834', 'https://openalex.org/W2087216833'], 'related_works': ['https://openalex.org/W4380840098', 'https://openalex.org/W2943635264', 'https://openalex.org/W2571550117', 'https://openalex.org/W2384589661', 'https://openalex.org/W2281826919', 'https://openalex.org/W2138987445', 'https://openalex.org/W2130375301', 'https://openalex.org/W2122848400', 'https://openalex.org/W1973100174', 'https://openalex.org/W1593284275'], 'abstract_inverted_index': {'This': [0, 17, 196, 296], 'paper': [1], 'proposed': [2, 58], 'a': [3, 8, 21, 26, 35, 81, 96, 156, 174, 316], 'new': [4, 18, 74, 82, 283], 'algorithm': [5, 19, 59, 64, 75, 146, 149, 164], 'to': [6, 24, 50, 128, 141, 154, 184], 'find': [7, 155], 'minimum': [9, 27, 31, 68, 102, 133, 157, 293, 321], 'spanning': [10, 28, 32, 69, 103, 134, 158, 294, 322], 'tree': [11, 33, 104, 135, 159, 317, 323], 'of': [12, 38, 54, 84, 89, 105, 113, 136, 160, 169, 205, 271, 311, 324], 'an': [13, 119], 'undirected': [14, 40, 107], 'weighted': [15, 41, 108, 236, 279], 'graph.': [16, 56, 162, 195], 'provides': [20], 'fresh': [22], 'approach': [23], 'produce': [25], 'tree.': [29, 70, 295], 'A': [30], 'is': [34, 60, 198, 248, 258, 265, 289, 299, 319], 'sub': [36], 'graph': [37, 42, 109, 138, 172, 207, 233, 327], 'any': [39, 55, 106, 137, 166, 191, 259], 'that': [43, 91, 185, 241, 251, 270, 304], 'gives': [44, 80], 'the': [45, 67, 87, 101, 132, 161, 170, 194, 206, 209, 232, 239, 245, 262, 282, 292, 309, 320, 325], 'minimal': [46], 'cost': [47], 'valued': [48], 'edges': [49, 210, 225, 240], 'reach': [51], 'every': [52, 181], 'node': [53, 168, 176, 204], 'The': [57], 'named': [61, 72], 'as': [62, 76, 78, 95, 115, 117, 173], 'RAY': [63, 122, 163, 330], 'for': [65, 99, 130, 234, 301], 'determining': [66], 'We': [71], 'this': [73, 215, 312], 'RAY,': [77], 'it': [79, 179], 'ray': [83], 'hope': [85], 'in': [86, 139, 193, 231, 244, 261, 267], 'field': [88], 'graphs': [90], 'can': [92], 'be': [93], 'used': [94, 153], 'better': [97], 'option': [98], 'finding': [100, 131], 'with': [110, 118, 126], 'less': [111, 124], 'duration': [112], 'time': [114, 129], 'well': [116], 'easy': [120], 'approach.': [121], 'has': [123], 'complexity': [125], 'respect': [127], 'comparison': [140], 'other': [142], 'algorithms': [143], 'like': [144], "prim's": [145], 'and': [147, 177, 208, 228, 281], "Kruskal's": [148], 'which': [150, 187, 247, 264, 285, 318], 'are': [151, 217, 226, 242], 'mostly': [152], 'select': [165], 'one': [167], 'given': [171, 326], 'root': [175], 'then': [178, 275], 'joins': [180], 'edge': [182, 237, 260, 274, 280, 284, 303], 'connected': [183], 'node,': [186], 'do': [188], 'not': [189], 'form': [190], 'cycle': [192, 213, 246, 263], 'process': [197, 216], 'repeated': [199, 300], 'until': [200], 'we': [201, 229, 276, 286, 305, 314], 'traverse': [202], 'each': [203, 302], 'those': [211], 'forms': [212], 'during': [214], 'stored': [218, 224, 254, 273, 287, 306], 'separately.': [219, 307], 'Now': [220], 'only': [221], 'these': [222], 'separately': [223, 253, 272, 288], 'traversed': [227], 'check': [230], 'maximum': [235, 278], 'from': [238], 'coming': [243], 'formed': [249], 'due': [250], 'particular': [252], 'edge.': [255], 'If': [256], 'there': [257], 'greater': [266], 'weigh': [268], 'than': [269], 'discarded': [277], 'taken': [290], 'into': [291], 'same': [297], 'procedure': [298, 313], 'At': [308], 'end': [310], 'get': [315], 'by': [328], 'using': [329], 'algorithm.': [331]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W1593284275', 'counts_by_year': [{'year': 2023, 'cited_by_count': 1}, {'year': 2021, 'cited_by_count': 1}, {'year': 2019, 'cited_by_count': 1}, {'year': 2018, 'cited_by_count': 2}, {'year': 2017, 'cited_by_count': 2}], 'updated_date': '2024-12-13T13:45:50.404632', 'created_date': '2016-06-24'}