{"id":"https://openalex.org/W4416250014","doi":"https://doi.org/10.1109/ijcnn64981.2025.11229420","title":"G2S: A Greedy Node Swapping Algorithm to Compute Upper Bound Graph Edit Distance","display_name":"G2S: A Greedy Node Swapping Algorithm to Compute Upper Bound Graph Edit Distance","publication_year":2025,"publication_date":"2025-06-30","ids":{"openalex":"https://openalex.org/W4416250014","doi":"https://doi.org/10.1109/ijcnn64981.2025.11229420"},"language":null,"primary_location":{"id":"doi:10.1109/ijcnn64981.2025.11229420","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn64981.2025.11229420","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 International Joint Conference on Neural Networks (IJCNN)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108051153","display_name":"Yao He","orcid":"https://orcid.org/0000-0001-6205-7895"},"institutions":[{"id":"https://openalex.org/I150229711","display_name":"University of Electronic Science and Technology of China","ror":"https://ror.org/04qr3zq92","country_code":"CN","type":"education","lineage":["https://openalex.org/I150229711"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yilei He","raw_affiliation_strings":["University of Electronic Science and Technology of China,Chengdu,China"],"affiliations":[{"raw_affiliation_string":"University of Electronic Science and Technology of China,Chengdu,China","institution_ids":["https://openalex.org/I150229711"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102942783","display_name":"Jiansu Pu","orcid":"https://orcid.org/0000-0002-4284-6958"},"institutions":[{"id":"https://openalex.org/I150229711","display_name":"University of Electronic Science and Technology of China","ror":"https://ror.org/04qr3zq92","country_code":"CN","type":"education","lineage":["https://openalex.org/I150229711"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jiansu Pu","raw_affiliation_strings":["University of Electronic Science and Technology of China,Chengdu,China"],"affiliations":[{"raw_affiliation_string":"University of Electronic Science and Technology of China,Chengdu,China","institution_ids":["https://openalex.org/I150229711"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030211805","display_name":"Detang Zhong","orcid":"https://orcid.org/0000-0002-2438-493X"},"institutions":[{"id":"https://openalex.org/I150229711","display_name":"University of Electronic Science and Technology of China","ror":"https://ror.org/04qr3zq92","country_code":"CN","type":"education","lineage":["https://openalex.org/I150229711"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Derui Zhong","raw_affiliation_strings":["University of Electronic Science and Technology of China,Chengdu,China"],"affiliations":[{"raw_affiliation_string":"University of Electronic Science and Technology of China,Chengdu,China","institution_ids":["https://openalex.org/I150229711"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5117403944","display_name":"Dejing Ke","orcid":null},"institutions":[{"id":"https://openalex.org/I150229711","display_name":"University of Electronic Science and Technology of China","ror":"https://ror.org/04qr3zq92","country_code":"CN","type":"education","lineage":["https://openalex.org/I150229711"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Dejing Ke","raw_affiliation_strings":["University of Electronic Science and Technology of China,Chengdu,China"],"affiliations":[{"raw_affiliation_string":"University of Electronic Science and Technology of China,Chengdu,China","institution_ids":["https://openalex.org/I150229711"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5107172095","display_name":"Jian Huang","orcid":"https://orcid.org/0000-0003-3340-5007"},"institutions":[{"id":"https://openalex.org/I150229711","display_name":"University of Electronic Science and Technology of China","ror":"https://ror.org/04qr3zq92","country_code":"CN","type":"education","lineage":["https://openalex.org/I150229711"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jinyue Huang","raw_affiliation_strings":["University of Electronic Science and Technology of China,Chengdu,China"],"affiliations":[{"raw_affiliation_string":"University of Electronic Science and Technology of China,Chengdu,China","institution_ids":["https://openalex.org/I150229711"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083796252","display_name":"Yuefei Zhu","orcid":"https://orcid.org/0000-0002-9559-8783"},"institutions":[{"id":"https://openalex.org/I4210119262","display_name":"Chengdu Design & Research Institute of Building Materials Industry (China)","ror":"https://ror.org/028xtjj97","country_code":"CN","type":"company","lineage":["https://openalex.org/I4210119262"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yanlin Zhu","raw_affiliation_strings":["Chengdu Advanced Metal Materials Industry Technology Research Institute Co.,Chengdu,China"],"affiliations":[{"raw_affiliation_string":"Chengdu Advanced Metal Materials Industry Technology Research Institute Co.,Chengdu,China","institution_ids":["https://openalex.org/I4210119262"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5108051153"],"corresponding_institution_ids":["https://openalex.org/I150229711"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.34296828,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9911999702453613,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9911999702453613,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.004999999888241291,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11719","display_name":"Data Quality and Management","score":0.0005000000237487257,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/initialization","display_name":"Initialization","score":0.6341999769210815},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.58160001039505},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5045999884605408},{"id":"https://openalex.org/keywords/edit-distance","display_name":"Edit distance","score":0.4918999969959259},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.483599990606308},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4799000024795532},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4465000033378601},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.3847000002861023},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.364300012588501}],"concepts":[{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.6341999769210815},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.604200005531311},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5878000259399414},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.58160001039505},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5045999884605408},{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.4918999969959259},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.483599990606308},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4799000024795532},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4465000033378601},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41370001435279846},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.3847000002861023},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.364300012588501},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.3479999899864197},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.3463999927043915},{"id":"https://openalex.org/C5737132","wikidata":"https://www.wikidata.org/wiki/Q1101814","display_name":"Clique-width","level":5,"score":0.3434999883174896},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.34040001034736633},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.33079999685287476},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3131999969482422},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.30649998784065247},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.27950000762939453},{"id":"https://openalex.org/C17169500","wikidata":"https://www.wikidata.org/wiki/Q3033506","display_name":"Null graph","level":5,"score":0.27889999747276306},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.27880001068115234},{"id":"https://openalex.org/C19332903","wikidata":"https://www.wikidata.org/wiki/Q7623247","display_name":"Strength of a graph","level":5,"score":0.26589998602867126},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.26429998874664307},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.2621999979019165},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.25839999318122864},{"id":"https://openalex.org/C148067565","wikidata":"https://www.wikidata.org/wiki/Q3323718","display_name":"Moral graph","level":5,"score":0.2554999887943268},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.2517000138759613},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.2515999972820282}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ijcnn64981.2025.11229420","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn64981.2025.11229420","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 International Joint Conference on Neural Networks (IJCNN)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W154498758","https://openalex.org/W235087399","https://openalex.org/W1492230849","https://openalex.org/W1605556478","https://openalex.org/W1965142824","https://openalex.org/W1969483458","https://openalex.org/W1975844474","https://openalex.org/W1976466396","https://openalex.org/W1983681808","https://openalex.org/W1996551363","https://openalex.org/W2007444087","https://openalex.org/W2032338144","https://openalex.org/W2099438806","https://openalex.org/W2109294083","https://openalex.org/W2115467367","https://openalex.org/W2137913010","https://openalex.org/W2151967815","https://openalex.org/W2170607286","https://openalex.org/W2471065468","https://openalex.org/W2789319383","https://openalex.org/W2906943923","https://openalex.org/W2953659968","https://openalex.org/W2962756421","https://openalex.org/W3176961136","https://openalex.org/W3204140782","https://openalex.org/W4210418387","https://openalex.org/W4239181501","https://openalex.org/W4242261337","https://openalex.org/W4300913086","https://openalex.org/W4381621982"],"related_works":[],"abstract_inverted_index":{"Graph":[0,10],"matching":[1],"is":[2,210],"a":[3,16,47,88,115,155],"widely":[4],"studied":[5],"and":[6,63,77,139,147,167],"applied":[7],"field,":[8],"with":[9,200],"Edit":[11],"Distance":[12],"(GED)":[13],"serving":[14],"as":[15],"fundamental":[17],"metric":[18],"for":[19,119],"evaluating":[20],"the":[21,36,71,79,100,110,125,173,185,195,214],"similarity":[22],"between":[23],"graphs.":[24],"As":[25],"an":[26,106],"NP-hard":[27],"problem":[28],"in":[29],"graph":[30,43,93,205],"theory,":[31],"GED":[32,55,75],"focuses":[33,68],"on":[34,54,69,109,177],"determining":[35],"minimum":[37],"cost":[38],"required":[39],"to":[40,91,113,132,134,143],"transform":[41],"one":[42],"into":[44,58],"another":[45],"through":[46,213],"series":[48],"of":[49,73,128,159,175,188,216],"edit":[50,101,178],"operations.":[51],"Existing":[52],"research":[53],"primarily":[56],"falls":[57],"two":[59],"categories:":[60],"exact":[61],"algorithms":[62],"inexact":[64,74],"algorithms.":[65],"This":[66],"paper":[67],"enhancing":[70],"accuracy":[72],"computation":[76],"introduces":[78],"Greedy":[80],"2-Swap":[81],"(G2S)":[82],"algorithm.":[83],"The":[84,181],"G2S":[85,176,196],"algorithm":[86,161,190,197],"adopts":[87],"greedy":[89,129],"strategy":[90],"explore":[92],"mappings,":[94],"consistently":[95],"selecting":[96],"mappings":[97],"that":[98],"minimize":[99],"distance.":[102],"Our":[103],"approach":[104],"establishes":[105],"upper":[107,117],"bound":[108,118],"GED,":[111],"aiming":[112],"achieve":[114],"lower":[116],"more":[120],"precise":[121],"results.":[122],"To":[123],"address":[124],"inherent":[126],"limitation":[127],"algorithms\u2014their":[130],"tendency":[131],"converge":[133],"local":[135],"optima\u2014we":[136],"propose":[137],"initialization":[138],"random":[140],"rearrangement":[141],"strategies":[142],"escape":[144],"such":[145],"states":[146],"enhance":[148],"solution":[149],"quality.":[150],"In":[151],"addition,":[152],"we":[153],"provide":[154],"comprehensive":[156],"comparative":[157],"analysis":[158],"our":[160,189],"against":[162],"state-of-the-art":[163],"methods,":[164],"including":[165],"A-star":[166],"GNN-based":[168],"approaches.":[169],"We":[170],"also":[171],"investigate":[172],"impact":[174],"distance":[179],"calculations.":[180],"experimental":[182],"results":[183],"highlight":[184],"superior":[186],"performance":[187],"across":[191,203],"various":[192],"metrics.":[193],"Notably,":[194],"combines":[198],"simplicity":[199],"robust":[201],"generalization":[202],"diverse":[204],"datasets.":[206],"Furthermore,":[207],"its":[208],"scalability":[209],"significantly":[211],"improved":[212],"integration":[215],"multiple":[217],"optimization":[218],"strategies.":[219]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-11-14T00:00:00"}