Publication Information

{'id': 'https://openalex.org/W2107862727', 'doi': 'https://doi.org/10.1109/iccse.2009.5228388', 'title': 'A new verification algorithm for minmum spanning tree based on reduction and merge technology', 'display_name': 'A new verification algorithm for minmum spanning tree based on reduction and merge technology', 'publication_year': 2009, 'publication_date': '2009-07-01', 'ids': {'openalex': 'https://openalex.org/W2107862727', 'doi': 'https://doi.org/10.1109/iccse.2009.5228388', 'mag': '2107862727'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://doi.org/10.1109/iccse.2009.5228388', 'pdf_url': None, 'source': None, '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/A5102140881', 'display_name': 'Xiong Xiao-hua', 'orcid': None}, 'institutions': [{'id': 'https://openalex.org/I148128674', 'display_name': 'University of Shanghai for Science and Technology', 'ror': 'https://ror.org/00ay9v204', 'country_code': 'CN', 'type': 'education', 'lineage': ['https://openalex.org/I148128674']}, {'id': 'https://openalex.org/I135905480', 'display_name': 'Shanghai Polytechnic University', 'ror': 'https://ror.org/02as5yg64', 'country_code': 'CN', 'type': 'education', 'lineage': ['https://openalex.org/I135905480']}], 'countries': ['CN'], 'is_corresponding': False, 'raw_author_name': 'None Xiong Xiao-hua', 'raw_affiliation_strings': ['College of Computer and Information, Shanghai Second Polytechnic University, Shanghai, China', 'School of Management, University of Shanghai for Science and Technology, Shanghai, China'], 'affiliations': [{'raw_affiliation_string': 'School of Management, University of Shanghai for Science and Technology, Shanghai, China', 'institution_ids': ['https://openalex.org/I148128674']}, {'raw_affiliation_string': 'College of Computer and Information, Shanghai Second Polytechnic University, Shanghai, China', 'institution_ids': ['https://openalex.org/I135905480']}]}, {'author_position': 'middle', 'author': {'id': 'https://openalex.org/A5054243342', 'display_name': 'Ning Ai-bing', 'orcid': None}, 'institutions': [{'id': 'https://openalex.org/I135905480', 'display_name': 'Shanghai Polytechnic University', 'ror': 'https://ror.org/02as5yg64', 'country_code': 'CN', 'type': 'education', 'lineage': ['https://openalex.org/I135905480']}], 'countries': ['CN'], 'is_corresponding': False, 'raw_author_name': 'None Ning Ai-bing', 'raw_affiliation_strings': ['College of Computer and Information, Shanghai Second Polytechnic University, Shanghai, China'], 'affiliations': [{'raw_affiliation_string': 'College of Computer and Information, Shanghai Second Polytechnic University, Shanghai, China', 'institution_ids': ['https://openalex.org/I135905480']}]}, {'author_position': 'last', 'author': {'id': 'https://openalex.org/A5090764760', 'display_name': 'Ma Liang', 'orcid': 'https://orcid.org/0000-0002-9786-5857'}, 'institutions': [{'id': 'https://openalex.org/I135905480', 'display_name': 'Shanghai Polytechnic University', 'ror': 'https://ror.org/02as5yg64', 'country_code': 'CN', 'type': 'education', 'lineage': ['https://openalex.org/I135905480']}], 'countries': ['CN'], 'is_corresponding': False, 'raw_author_name': 'None Ma Liang', 'raw_affiliation_strings': ['College of Computer and Information, Shanghai Second Polytechnic University, Shanghai, China'], 'affiliations': [{'raw_affiliation_string': 'College of Computer and Information, Shanghai Second Polytechnic University, Shanghai, China', 'institution_ids': ['https://openalex.org/I135905480']}]}], 'institution_assertions': [], 'countries_distinct_count': 1, 'institutions_distinct_count': 2, 'corresponding_author_ids': [], 'corresponding_institution_ids': [], 'apc_list': None, 'apc_paid': None, 'fwci': 0.0, 'has_fulltext': True, 'fulltext_origin': 'ngrams', 'cited_by_count': 2, 'citation_normalized_percentile': {'value': 0.279274, 'is_in_top_1_percent': False, 'is_in_top_10_percent': False}, 'cited_by_percentile_year': {'min': 71, 'max': 74}, 'biblio': {'volume': None, 'issue': None, 'first_page': '469', 'last_page': '473'}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T10142', 'display_name': 'Formal Methods in Verification', 'score': 0.9966, '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'}}, 'topics': [{'id': 'https://openalex.org/T10142', 'display_name': 'Formal Methods in Verification', 'score': 0.9966, '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/T10743', 'display_name': 'Software Testing and Debugging Techniques', 'score': 0.9785, '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/T10720', 'display_name': 'Complexity and Algorithms in Graphs', 'score': 0.9768, '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'}}], 'keywords': [{'id': 'https://openalex.org/keywords/reverse-delete-algorithm', 'display_name': 'Reverse-delete algorithm', 'score': 0.6586362}, {'id': 'https://openalex.org/keywords/prims-algorithm', 'display_name': "Prim's algorithm", 'score': 0.63010806}, {'id': 'https://openalex.org/keywords/merge', 'display_name': 'Merge (version control)', 'score': 0.60562027}, {'id': 'https://openalex.org/keywords/connectivity', 'display_name': 'Connectivity', 'score': 0.487443}], 'concepts': [{'id': 'https://openalex.org/C13743678', 'wikidata': 'https://www.wikidata.org/wiki/Q240464', 'display_name': 'Minimum spanning tree', 'level': 2, 'score': 0.8737284}, {'id': 'https://openalex.org/C64331007', 'wikidata': 'https://www.wikidata.org/wiki/Q831672', 'display_name': 'Spanning tree', 'level': 2, 'score': 0.83786404}, {'id': 'https://openalex.org/C63645285', 'wikidata': 'https://www.wikidata.org/wiki/Q797860', 'display_name': "Kruskal's algorithm", 'level': 3, 'score': 0.81237024}, {'id': 'https://openalex.org/C37810922', 'wikidata': 'https://www.wikidata.org/wiki/Q5161409', 'display_name': 'Connected dominating set', 'level': 3, 'score': 0.6749535}, {'id': 'https://openalex.org/C199346575', 'wikidata': 'https://www.wikidata.org/wiki/Q4925151', 'display_name': 'Reverse-delete algorithm', 'level': 4, 'score': 0.6586362}, {'id': 'https://openalex.org/C1649724', 'wikidata': 'https://www.wikidata.org/wiki/Q470813', 'display_name': "Prim's algorithm", 'level': 4, 'score': 0.63010806}, {'id': 'https://openalex.org/C65949645', 'wikidata': 'https://www.wikidata.org/wiki/Q5283163', 'display_name': 'Distributed minimum spanning tree', 'level': 3, 'score': 0.6141773}, {'id': 'https://openalex.org/C197129107', 'wikidata': 'https://www.wikidata.org/wiki/Q1921621', 'display_name': 'Merge (version control)', 'level': 2, 'score': 0.60562027}, {'id': 'https://openalex.org/C145685049', 'wikidata': 'https://www.wikidata.org/wiki/Q4454941', 'display_name': 'Euclidean minimum spanning tree', 'level': 4, 'score': 0.5273612}, {'id': 'https://openalex.org/C132525143', 'wikidata': 'https://www.wikidata.org/wiki/Q141488', 'display_name': 'Graph', 'level': 2, 'score': 0.4998412}, {'id': 'https://openalex.org/C76444178', 'wikidata': 'https://www.wikidata.org/wiki/Q72897900', 'display_name': 'Connectivity', 'level': 3, 'score': 0.487443}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.46779567}, {'id': 'https://openalex.org/C11413529', 'wikidata': 'https://www.wikidata.org/wiki/Q8366', 'display_name': 'Algorithm', 'level': 1, 'score': 0.46185267}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.40461427}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.304645}, {'id': 'https://openalex.org/C80444323', 'wikidata': 'https://www.wikidata.org/wiki/Q2878974', 'display_name': 'Theoretical computer science', 'level': 1, 'score': 0.2894276}, {'id': 'https://openalex.org/C173608175', 'wikidata': 'https://www.wikidata.org/wiki/Q232661', 'display_name': 'Parallel computing', 'level': 1, 'score': 0.07181093}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'https://doi.org/10.1109/iccse.2009.5228388', 'pdf_url': None, 'source': None, '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': 9, 'referenced_works': ['https://openalex.org/W1655990431', 'https://openalex.org/W1978099551', 'https://openalex.org/W2011999472', 'https://openalex.org/W2023658462', 'https://openalex.org/W2028507750', 'https://openalex.org/W2029403470', 'https://openalex.org/W2087216833', 'https://openalex.org/W2096765938', 'https://openalex.org/W2138304862'], 'related_works': ['https://openalex.org/W4380840098', 'https://openalex.org/W3101457564', 'https://openalex.org/W3016811403', 'https://openalex.org/W3010298256', 'https://openalex.org/W2899787781', 'https://openalex.org/W2589768050', 'https://openalex.org/W2390742649', 'https://openalex.org/W2387385213', 'https://openalex.org/W2381121915', 'https://openalex.org/W2353025557'], 'abstract_inverted_index': {'The': [0, 50, 155, 178], 'minimum': [1, 68, 165], 'spanning': [2, 61, 69, 153, 161, 166], 'tree(MST)': [3], 'of': [4, 11, 35, 56, 63, 73, 89, 97, 123, 132, 157, 168, 194], 'a': [5, 23, 33, 39, 44, 47, 59, 64, 67, 115, 149, 164], 'graph': [6, 16, 65, 78, 151, 171], 'defines': [7], 'the': [8, 15, 77, 94, 100, 109, 121, 124, 128, 137, 159, 169, 175, 189, 192, 195], 'cheapest': [9], 'subset': [10], 'edges': [12, 90, 138], 'that': [13, 55], 'keeps': [14], 'in': [17, 26, 32, 46, 141, 185], 'one': [18], 'connected': [19], 'component': [20], 'which': [21], 'is': [22, 54, 66, 72, 114, 163, 172, 180, 199], 'classic': [24], 'problem': [25, 41, 51, 125, 156], 'operational': [27], 'research(OR)': [28], 'with': [29], 'important': [30], 'applications': [31], 'number': [34], 'applications,': [36], 'both': [37], 'as': [38, 43, 85], 'stand-alone': [40], 'and': [42, 93, 106, 118, 135, 152, 182, 191], 'subproblem': [45], 'more': [48], 'complex.': [49], 'considered': [52], 'here': [53, 113], 'determining': [57], 'whether': [58], 'given': [60], 'tree': [62, 162, 167], 'tree.': [70, 154], 'It': [71], 'great': [74], 'importance': [75], 'while': [76], 'subjects': [79], 'to': [80, 126, 174, 187], 'some': [81], 'discrete': [82], 'changes,': [83], 'such': [84], 'additions': [86], 'or': [87, 91], 'deletions': [88], 'vertexes': [92, 130, 145], 'cost': [95], 'variation': [96], 'edges.': [98], 'Unlike': [99], 'algorithms': [101], 'presented': [102, 112], 'by': [103, 144], 'Tarjan,': [104], 'Komloacutes': [105], 'other': [107], 'people,': [108], 'verification': [110], 'algorithm': [111, 179, 196], 'liner': [116], 'time': [117], 'fully': [119], 'employs': [120], 'properties': [122], 'remove': [127], 'pendant': [129], '(vertexes': [131], 'degree': [133], '1)': [134], 'specify': [136], 'must': [139], 'be': [140], 'MST.': [142], 'Then': [143], 'merge': [146], 'technology': [147], 'creates': [148], 'reduced': [150], 'verifying': [158], 'new': [160, 170], 'equal': [173], 'original': [176], 'problem.': [177], 'simple': [181], 'practical.': [183], 'Finally': [184], 'order': [186], 'demonstrate': [188], 'principle': [190], 'process': [193], 'an': [197], 'example': [198], 'also': [200], 'presented.': [201]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W2107862727', 'counts_by_year': [{'year': 2021, 'cited_by_count': 1}, {'year': 2012, 'cited_by_count': 1}], 'updated_date': '2024-12-13T02:31:20.251724', 'created_date': '2016-06-24'}