{"id":"https://openalex.org/W2902884702","doi":"https://doi.org/10.1109/icpr.2018.8546841","title":"Graph Edit Distance Testing through Synthetic Graphs Generation","display_name":"Graph Edit Distance Testing through Synthetic Graphs Generation","publication_year":2018,"publication_date":"2018-08-01","ids":{"openalex":"https://openalex.org/W2902884702","doi":"https://doi.org/10.1109/icpr.2018.8546841","mag":"2902884702"},"language":"en","primary_location":{"id":"doi:10.1109/icpr.2018.8546841","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpr.2018.8546841","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 24th International Conference on Pattern Recognition (ICPR)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5026710217","display_name":"Pep Santacruz","orcid":"https://orcid.org/0000-0002-4901-509X"},"institutions":[{"id":"https://openalex.org/I55952717","display_name":"Universitat Rovira i Virgili","ror":"https://ror.org/00g5sqv46","country_code":"ES","type":"education","lineage":["https://openalex.org/I55952717"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Pep Santacruz","raw_affiliation_strings":["Departament d'Enginyeria Informatica i Matematiqucs, Universitat Rovira i Virgili Tarragona, Catalonia, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departament d'Enginyeria Informatica i Matematiqucs, Universitat Rovira i Virgili Tarragona, Catalonia, Spain","institution_ids":["https://openalex.org/I55952717"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090033395","display_name":"Francesc Serratosa","orcid":"https://orcid.org/0000-0001-6112-5913"},"institutions":[{"id":"https://openalex.org/I55952717","display_name":"Universitat Rovira i Virgili","ror":"https://ror.org/00g5sqv46","country_code":"ES","type":"education","lineage":["https://openalex.org/I55952717"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Francese Serratosa","raw_affiliation_strings":["Departament d'Enginyeria Informatica i Matematiqucs, Universitat Rovira i Virgili Tarragona, Catalonia, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departament d'Enginyeria Informatica i Matematiqucs, Universitat Rovira i Virgili Tarragona, Catalonia, Spain","institution_ids":["https://openalex.org/I55952717"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I55952717"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"572","last_page":"577"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.9811000227928162,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9699000120162964,"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/computer-science","display_name":"Computer science","score":0.6446521282196045},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6009668707847595},{"id":"https://openalex.org/keywords/edit-distance","display_name":"Edit distance","score":0.5258315801620483},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.490315705537796},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.45560353994369507},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42789626121520996},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42006564140319824},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph algorithms","score":0.4197004437446594},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.395367830991745},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2704586088657379}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6446521282196045},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6009668707847595},{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.5258315801620483},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.490315705537796},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.45560353994369507},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42789626121520996},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42006564140319824},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.4197004437446594},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.395367830991745},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2704586088657379},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icpr.2018.8546841","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpr.2018.8546841","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 24th International Conference on Pattern Recognition (ICPR)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320332999","display_name":"Horizon 2020 Framework Programme","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1492230849","https://openalex.org/W1976466396","https://openalex.org/W1983681808","https://openalex.org/W1996551363","https://openalex.org/W2011039300","https://openalex.org/W2027805278","https://openalex.org/W2051786535","https://openalex.org/W2064000859","https://openalex.org/W2076554191","https://openalex.org/W2083748845","https://openalex.org/W2100937287","https://openalex.org/W2109294083","https://openalex.org/W2143387021","https://openalex.org/W2150760714","https://openalex.org/W2159537329","https://openalex.org/W2170607286","https://openalex.org/W2222512263","https://openalex.org/W2487305562","https://openalex.org/W2506039404","https://openalex.org/W2534615593","https://openalex.org/W2548295426","https://openalex.org/W2548595052","https://openalex.org/W2612340705","https://openalex.org/W2795707704","https://openalex.org/W2801527615","https://openalex.org/W6725181082","https://openalex.org/W6749655508"],"related_works":["https://openalex.org/W3044917232","https://openalex.org/W1498160656","https://openalex.org/W2119149496","https://openalex.org/W2055693471","https://openalex.org/W4295101776","https://openalex.org/W1510522864","https://openalex.org/W74055483","https://openalex.org/W4390436776","https://openalex.org/W3016558738","https://openalex.org/W4210508727"],"abstract_inverted_index":{"Error-tolerant":[0],"graph":[1,87,97],"matching":[2,88],"has":[3],"been":[4,17,33],"demonstrated":[5],"to":[6,40,57,115,132,144,154,157],"be":[7],"an":[8,62,94],"NP-problem,":[9],"for":[10,47],"this":[11,73],"reason,":[12],"several":[13],"suboptimal":[14],"algorithms":[15,31,89],"have":[16,32,108],"presented":[18],"with":[19,35,61,68,122,130,152],"the":[20,24,41,44,78,81,109,133,142,155],"aim":[21],"of":[22,43,80,119,135,148],"making":[23],"runtime":[25,143,156],"acceptable":[26],"in":[27],"some":[28],"applications.":[29],"These":[30],"tested":[34],"relative":[36],"small":[37],"graphs":[38,59,120,149],"due":[39],"computation":[42],"true":[45,110],"distance":[46,67,99],"comparison":[48],"purposes":[49],"is":[50,128,150],"too":[51],"costly.":[52],"We":[53],"present":[54],"a":[55,91,117,146],"method":[56],"generate":[58,116,145],"together":[60,121],"upper":[63,95,124],"and":[64,93,125],"lower":[65,92,126],"bound":[66,96],"linear":[69,129],"computational":[70,113],"cost.":[71],"Through":[72],"method,":[74],"we":[75,105],"can":[76],"test":[77],"behaviour":[79],"known":[82],"or":[83],"new":[84],"sub-optimal":[85],"error-tolerant":[86],"against":[90],"edit":[98],"on":[100],"large":[101],"graphs,":[102],"even":[103],"though":[104],"do":[106],"not":[107],"distance.":[111],"The":[112,137],"cost":[114],"pair":[118,147],"their":[123],"bounds":[127],"regard":[131,153],"number":[134],"nodes.":[136],"practical":[138],"experimentation":[139],"shows":[140],"that":[141],"negligible":[151],"match":[158],"them.":[159]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}