Publication Information

{'id': 'https://openalex.org/W1977899923', 'doi': 'https://doi.org/10.1145/1353564.1353566', 'title': 'Renovation of minimum spanning tree algorithms of weighted graph', 'display_name': 'Renovation of minimum spanning tree algorithms of weighted graph', 'publication_year': 2008, 'publication_date': '2008-02-01', 'ids': {'openalex': 'https://openalex.org/W1977899923', 'doi': 'https://doi.org/10.1145/1353564.1353566', 'mag': '1977899923'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://dblp.uni-trier.de/db/journals/ubiquity/ubiquity2008.html#Pal08', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S134936796', 'display_name': 'Ubiquity', 'issn_l': '1530-2180', 'issn': ['1530-2180'], 'is_oa': True, 'is_in_doaj': False, 'is_core': True, 'host_organization': 'https://openalex.org/P4310319798', 'host_organization_name': 'Association for Computing Machinery', 'host_organization_lineage': ['https://openalex.org/P4310319798'], 'host_organization_lineage_names': ['Association for Computing Machinery'], 'type': 'journal'}, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}, 'type': 'article', 'type_crossref': 'journal-article', 'indexed_in': [], '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/A5022408324', 'display_name': 'Sanjay Kumar Pal', 'orcid': 'https://orcid.org/0000-0002-7558-4392'}, 'institutions': [], 'countries': ['IN'], 'is_corresponding': True, 'raw_author_name': 'Sanjay Kumar Pal', 'raw_affiliation_strings': ['NSHM Business School, India'], 'affiliations': [{'raw_affiliation_string': 'NSHM Business School, India', 'institution_ids': []}]}], 'institution_assertions': [], 'countries_distinct_count': 1, 'institutions_distinct_count': 0, 'corresponding_author_ids': ['https://openalex.org/A5022408324'], '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': 63}, 'biblio': {'volume': '2008', 'issue': None, 'first_page': '4', 'last_page': None}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T10743', 'display_name': 'Software Testing and Debugging Techniques', 'score': 0.9994, 'subfield': {'id': 'https://openalex.org/subfields/1712', 'display_name': 'Software'}, '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/T10743', 'display_name': 'Software Testing and Debugging Techniques', 'score': 0.9994, 'subfield': {'id': 'https://openalex.org/subfields/1712', 'display_name': 'Software'}, '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/T10142', 'display_name': 'Formal Methods in Verification', 'score': 0.9974, 'subfield': {'id': 'https://openalex.org/subfields/1703', 'display_name': 'Computational Theory and Mathematics'}, '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/T10904', 'display_name': 'Embedded Systems Design Techniques', 'score': 0.9834, 'subfield': {'id': 'https://openalex.org/subfields/1708', 'display_name': 'Hardware and Architecture'}, '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/reverse-delete-algorithm', 'display_name': 'Reverse-delete algorithm', 'score': 0.6585535}, {'id': 'https://openalex.org/keywords/prims-algorithm', 'display_name': "Prim's algorithm", 'score': 0.5535649}, {'id': 'https://openalex.org/keywords/cycle-basis', 'display_name': 'Cycle basis', 'score': 0.49408486}, {'id': 'https://openalex.org/keywords/tree', 'display_name': 'Tree (set theory)', 'score': 0.45734903}, {'id': 'https://openalex.org/keywords/k-minimum-spanning-tree', 'display_name': 'k-minimum spanning tree', 'score': 0.4235756}], 'concepts': [{'id': 'https://openalex.org/C64331007', 'wikidata': 'https://www.wikidata.org/wiki/Q831672', 'display_name': 'Spanning tree', 'level': 2, 'score': 0.8727754}, {'id': 'https://openalex.org/C13743678', 'wikidata': 'https://www.wikidata.org/wiki/Q240464', 'display_name': 'Minimum spanning tree', 'level': 2, 'score': 0.87268037}, {'id': 'https://openalex.org/C63645285', 'wikidata': 'https://www.wikidata.org/wiki/Q797860', 'display_name': "Kruskal's algorithm", 'level': 3, 'score': 0.7252509}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.6774386}, {'id': 'https://openalex.org/C37810922', 'wikidata': 'https://www.wikidata.org/wiki/Q5161409', 'display_name': 'Connected dominating set', 'level': 3, 'score': 0.67121303}, {'id': 'https://openalex.org/C65949645', 'wikidata': 'https://www.wikidata.org/wiki/Q5283163', 'display_name': 'Distributed minimum spanning tree', 'level': 3, 'score': 0.66446054}, {'id': 'https://openalex.org/C199346575', 'wikidata': 'https://www.wikidata.org/wiki/Q4925151', 'display_name': 'Reverse-delete algorithm', 'level': 4, 'score': 0.6585535}, {'id': 'https://openalex.org/C1649724', 'wikidata': 'https://www.wikidata.org/wiki/Q470813', 'display_name': "Prim's algorithm", 'level': 4, 'score': 0.5535649}, {'id': 'https://openalex.org/C132525143', 'wikidata': 'https://www.wikidata.org/wiki/Q141488', 'display_name': 'Graph', 'level': 2, 'score': 0.513577}, {'id': 'https://openalex.org/C145685049', 'wikidata': 'https://www.wikidata.org/wiki/Q4454941', 'display_name': 'Euclidean minimum spanning tree', 'level': 4, 'score': 0.50310487}, {'id': 'https://openalex.org/C26752605', 'wikidata': 'https://www.wikidata.org/wiki/Q16766188', 'display_name': 'Cycle basis', 'level': 5, 'score': 0.49408486}, {'id': 'https://openalex.org/C11413529', 'wikidata': 'https://www.wikidata.org/wiki/Q8366', 'display_name': 'Algorithm', 'level': 1, 'score': 0.47172183}, {'id': 'https://openalex.org/C113174947', 'wikidata': 'https://www.wikidata.org/wiki/Q2859736', 'display_name': 'Tree (set theory)', 'level': 2, 'score': 0.45734903}, {'id': 'https://openalex.org/C202750272', 'wikidata': 'https://www.wikidata.org/wiki/Q6322849', 'display_name': 'k-minimum spanning tree', 'level': 5, 'score': 0.4235756}, {'id': 'https://openalex.org/C80444323', 'wikidata': 'https://www.wikidata.org/wiki/Q2878974', 'display_name': 'Theoretical computer science', 'level': 1, 'score': 0.32629597}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.23860529}, {'id': 'https://openalex.org/C100560664', 'wikidata': 'https://www.wikidata.org/wiki/Q3608019', 'display_name': 'K-ary tree', 'level': 4, 'score': 0.22563183}, {'id': 'https://openalex.org/C163797641', 'wikidata': 'https://www.wikidata.org/wiki/Q2067937', 'display_name': 'Tree structure', 'level': 3, 'score': 0.19685215}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.19035909}, {'id': 'https://openalex.org/C203776342', 'wikidata': 'https://www.wikidata.org/wiki/Q1378376', 'display_name': 'Line graph', 'level': 3, 'score': 0.09328407}, {'id': 'https://openalex.org/C149530733', 'wikidata': 'https://www.wikidata.org/wiki/Q5597091', 'display_name': 'Graph power', 'level': 4, 'score': 0.08082247}, {'id': 'https://openalex.org/C197855036', 'wikidata': 'https://www.wikidata.org/wiki/Q380172', 'display_name': 'Binary tree', 'level': 2, 'score': 0.07948819}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'https://dblp.uni-trier.de/db/journals/ubiquity/ubiquity2008.html#Pal08', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S134936796', 'display_name': 'Ubiquity', 'issn_l': '1530-2180', 'issn': ['1530-2180'], 'is_oa': True, 'is_in_doaj': False, 'is_core': True, 'host_organization': 'https://openalex.org/P4310319798', 'host_organization_name': 'Association for Computing Machinery', 'host_organization_lineage': ['https://openalex.org/P4310319798'], 'host_organization_lineage_names': ['Association for Computing Machinery'], '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': 2, 'referenced_works': ['https://openalex.org/W2308777515', 'https://openalex.org/W75076678'], 'related_works': ['https://openalex.org/W3174709844', 'https://openalex.org/W3023158453', 'https://openalex.org/W2582147058', 'https://openalex.org/W2477124885', 'https://openalex.org/W2371157450', 'https://openalex.org/W2363076693', 'https://openalex.org/W2360026231', 'https://openalex.org/W2358746580', 'https://openalex.org/W2353822696', 'https://openalex.org/W2349955314', 'https://openalex.org/W2348255823', 'https://openalex.org/W2142818506', 'https://openalex.org/W2138987445', 'https://openalex.org/W2126785038', 'https://openalex.org/W2096544426', 'https://openalex.org/W2063966527', 'https://openalex.org/W2055747731', 'https://openalex.org/W2000695296', 'https://openalex.org/W1948148225', 'https://openalex.org/W1842018596'], 'abstract_inverted_index': {'In': [0], 'this': [1, 43], 'paper': [2], 'we': [3, 22, 54], 'describe': [4, 55], 'and': [5], 'explain': [6], 'the': [7, 47], 'Minimum': [8, 37, 57], 'Spanning': [9, 38, 58, 77], 'Tree': [10, 59], '(MST)': [11], 'generation': [12, 35], 'algorithms': [13, 60], 'of': [14, 36, 75], 'a': [15, 24, 65], 'weighted': [16, 62], 'graph': [17, 63], 'with': [18, 64, 79], 'renovated': [19, 66], 'idea.': [20, 67], 'Here,': [21], 'used': [23], 'new': [25, 71], 'cycle': [26, 51], 'testing': [27, 30], 'algorithm': [28], 'for': [29, 50, 61, 73], 'cycles,': [31], 'if': [32], 'required,': [33], 'in': [34], 'Tree.': [39], 'The': [40], 'reason': [41], 'behind': [42], 'is': [44], 'to': [45], 'optimize': [46], 'execution': [48], 'time': [49, 81], 'testing.': [52], 'Also,': [53], 'some': [56], 'We': [68], 'applied': [69], 'here': [70], 'concept': [72], 'explanation': [74], 'minimum': [76], 'tree': [78], 'better': [80], 'complexity.': [82]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W1977899923', 'counts_by_year': [], 'updated_date': '2024-12-12T10:35:56.310243', 'created_date': '2016-06-24'}