{"id":"https://openalex.org/W2608653080","doi":"https://doi.org/10.1109/icpr.2016.7899881","title":"Graph edit distance as a quadratic program","display_name":"Graph edit distance as a quadratic program","publication_year":2016,"publication_date":"2016-12-01","ids":{"openalex":"https://openalex.org/W2608653080","doi":"https://doi.org/10.1109/icpr.2016.7899881","mag":"2608653080"},"language":"en","primary_location":{"id":"doi:10.1109/icpr.2016.7899881","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpr.2016.7899881","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 23rd International Conference on Pattern Recognition (ICPR)","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-01418937","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5114376778","display_name":"S\u00e9bastien Bougleux","orcid":"https://orcid.org/0000-0002-4581-7570"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210139483","display_name":"GREYC","ror":"https://ror.org/043749971","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I194210350","https://openalex.org/I4210105918","https://openalex.org/I4210105918","https://openalex.org/I4210139483","https://openalex.org/I4210159245","https://openalex.org/I98702875"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Sebastien Bougleux","raw_affiliation_strings":["GREYC, CNRS, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"GREYC, CNRS, France","institution_ids":["https://openalex.org/I4210139483","https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016571081","display_name":"Beno\u00eet Ga\u00fcz\u00e8re","orcid":"https://orcid.org/0000-0001-9980-2641"},"institutions":[{"id":"https://openalex.org/I4210105918","display_name":"Normandie Universit\u00e9","ror":"https://ror.org/01k40cz91","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210105918"]},{"id":"https://openalex.org/I4210108118","display_name":"Laboratoire d'Informatique, du Traitement de l'Information et des Syst\u00e8mes","ror":"https://ror.org/01f1vfy95","country_code":"FR","type":"facility","lineage":["https://openalex.org/I141576021","https://openalex.org/I4210105918","https://openalex.org/I4210105918","https://openalex.org/I4210105918","https://openalex.org/I4210108118","https://openalex.org/I62396329","https://openalex.org/I88814501"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Benoit Gauzere","raw_affiliation_strings":["Normandie Univ, LITIS, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Normandie Univ, LITIS, France","institution_ids":["https://openalex.org/I4210105918","https://openalex.org/I4210108118"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067287623","display_name":"Luc Brun","orcid":"https://orcid.org/0000-0002-1658-0527"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210139483","display_name":"GREYC","ror":"https://ror.org/043749971","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I194210350","https://openalex.org/I4210105918","https://openalex.org/I4210105918","https://openalex.org/I4210139483","https://openalex.org/I4210159245","https://openalex.org/I98702875"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Luc Brun","raw_affiliation_strings":["GREYC, CNRS, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"GREYC, CNRS, France","institution_ids":["https://openalex.org/I4210139483","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6902,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.89919036,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1701","last_page":"1706"},"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.991599977016449,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9825999736785889,"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/bipartite-graph","display_name":"Bipartite graph","score":0.6655627489089966},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5813335180282593},{"id":"https://openalex.org/keywords/edit-distance","display_name":"Edit distance","score":0.5697184801101685},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.49160322546958923},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.48072221875190735},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.480003297328949},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4711545705795288},{"id":"https://openalex.org/keywords/quadratic-assignment-problem","display_name":"Quadratic assignment problem","score":0.4706391990184784},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.460421085357666},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43689653277397156},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4313785433769226},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4145321846008301},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.41094648838043213},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.30602332949638367},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29059696197509766},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.24287807941436768}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6655627489089966},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5813335180282593},{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.5697184801101685},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.49160322546958923},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.48072221875190735},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.480003297328949},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4711545705795288},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.4706391990184784},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.460421085357666},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43689653277397156},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4313785433769226},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4145321846008301},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.41094648838043213},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.30602332949638367},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29059696197509766},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.24287807941436768},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icpr.2016.7899881","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpr.2016.7899881","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 23rd International Conference on Pattern Recognition (ICPR)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-01418937v1","is_oa":true,"landing_page_url":"https://hal.science/hal-01418937","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.icpr2016.org/site/","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01418937v1","is_oa":true,"landing_page_url":"https://hal.science/hal-01418937","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.icpr2016.org/site/","raw_type":"Conference papers"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W83683671","https://openalex.org/W826976758","https://openalex.org/W1485714115","https://openalex.org/W1839955272","https://openalex.org/W1975844474","https://openalex.org/W1977866540","https://openalex.org/W2010541316","https://openalex.org/W2027340372","https://openalex.org/W2032338144","https://openalex.org/W2040080630","https://openalex.org/W2072573705","https://openalex.org/W2107855892","https://openalex.org/W2108217106","https://openalex.org/W2125690626","https://openalex.org/W2170607286","https://openalex.org/W2198460228","https://openalex.org/W2301548481","https://openalex.org/W2487305562","https://openalex.org/W2506039404","https://openalex.org/W4239749705","https://openalex.org/W6676075050","https://openalex.org/W6687313286","https://openalex.org/W6697714364"],"related_works":["https://openalex.org/W2371352078","https://openalex.org/W3044917232","https://openalex.org/W2624871005","https://openalex.org/W2068671103","https://openalex.org/W1977397354","https://openalex.org/W4211141987","https://openalex.org/W1982131534","https://openalex.org/W2140640384","https://openalex.org/W2788557015","https://openalex.org/W2537743657"],"abstract_inverted_index":{"The":[0],"graph":[1,14,27],"edit":[2],"distance":[3],"(GED)":[4],"measures":[5],"the":[6,23,32,42,45,56,82,105,114,137],"amount":[7],"of":[8,25,31,44,143,154],"distortion":[9],"needed":[10],"to":[11,81,103,116,136],"transform":[12],"a":[13,19,72,90],"into":[15],"another":[16],"graph.":[17],"Such":[18],"distance,":[20],"developed":[21],"in":[22,37],"context":[24],"error-tolerant":[26],"matching,":[28],"is":[29,48,87],"one":[30],"most":[33],"flexible":[34],"tool":[35],"used":[36],"structural":[38],"pattern":[39],"recognition.":[40],"However,":[41],"computation":[43],"exact":[46,83,138],"GED":[47,121,139],"NP-complete.":[49],"Hence":[50],"several":[51],"suboptimal":[52],"solutions,":[53],"such":[54],"as":[55,89],"ones":[57],"based":[58],"on":[59,151],"bipartite":[60],"assignments":[61],"with":[62],"edition,":[63],"have":[64,98],"been":[65,99],"proposed.":[66],"In":[67],"this":[68],"paper":[69],"we":[70],"propose":[71],"binary":[73],"quadratic":[74,91],"programming":[75],"problem":[76,86,93],"whose":[77],"global":[78],"minimum":[79],"corresponds":[80],"GED.":[84],"This":[85,101],"interpreted":[88],"assignment":[92],"(QAP)":[94],"where":[95],"some":[96],"constraints":[97],"relaxed.":[100],"allows":[102],"adapt":[104],"integer":[106],"projected":[107],"fixed":[108],"point":[109],"algorithm,":[110],"initially":[111],"designed":[112],"for":[113,140],"QAP,":[115],"efficiently":[117],"compute":[118],"an":[119,124],"approximate":[120],"by":[122],"finding":[123],"interesting":[125],"local":[126],"minimum.":[127],"Experiments":[128],"show":[129],"that":[130],"our":[131],"method":[132],"remains":[133],"quite":[134],"close":[135],"datasets":[141,152],"composed":[142,153],"small":[144],"graphs,":[145],"while":[146],"keeping":[147],"low":[148],"execution":[149],"times":[150],"larger":[155],"graphs.":[156]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}