<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-01579501</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-19T06:36:38+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Solving the graph edit distance problem with variable partitioning local search</title>
            <author role="aut">
              <persName>
                <forename type="first">Mostafa</forename>
                <surname>Darwiche</surname>
              </persName>
              <email type="md5">beccb36f5550ec07cc3144d2ee97b818</email>
              <email type="domain">gmail.com</email>
              <idno type="idhal" notation="numeric">1015249</idno>
              <idno type="halauthorid" notation="string">1214861-1015249</idno>
              <affiliation ref="#struct-204893"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Donatello</forename>
                <surname>Conte</surname>
              </persName>
              <email type="md5">52714530070d27becdfa99afcc4d3b4f</email>
              <email type="domain">proton.me</email>
              <idno type="idhal" notation="string">donatello-conte</idno>
              <idno type="idhal" notation="numeric">1091</idno>
              <idno type="halauthorid" notation="string">23549-1091</idno>
              <idno type="IDREF">https://www.idref.fr/113061498</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-4642-4768</idno>
              <affiliation ref="#struct-204893"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Romain</forename>
                <surname>Raveaux</surname>
              </persName>
              <email type="md5">36e87faec2a0d4f1e9dca30756337294</email>
              <email type="domain">gmail.com</email>
              <idno type="idhal" notation="string">romain-raveaux</idno>
              <idno type="idhal" notation="numeric">13038</idno>
              <idno type="halauthorid" notation="string">3477-13038</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-3149-0498</idno>
              <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=q3ou3o4AAAAJ&amp;hl=fr</idno>
              <idno type="IDREF">https://www.idref.fr/150185243</idno>
              <affiliation ref="#struct-204893"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Vincent</forename>
                <surname>T'kindt</surname>
              </persName>
              <email type="md5">bd91ec955babf6b13971d7ca6aa5b7fb</email>
              <email type="domain">univ-tours.fr</email>
              <idno type="idhal" notation="string">vincent-tkindt</idno>
              <idno type="idhal" notation="numeric">8188</idno>
              <idno type="halauthorid" notation="string">2995821-8188</idno>
              <idno type="IDREF">https://www.idref.fr/073272302</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-7440-2980</idno>
              <affiliation ref="#struct-204893"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Mostafa</forename>
                <surname>Darwiche</surname>
              </persName>
              <email type="md5">beccb36f5550ec07cc3144d2ee97b818</email>
              <email type="domain">gmail.com</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2019-09-13 12:12:16</date>
              <date type="whenWritten">2019</date>
              <date type="whenModified">2025-11-04 17:34:07</date>
              <date type="whenReleased">2019-09-13 17:27:08</date>
              <date type="whenProduced">2019-06-19</date>
              <date type="whenEndEmbargoed">2019-09-13</date>
              <ref type="file" target="https://hal.science/hal-01579501v1/document">
                <date notBefore="2019-09-13"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-01579501v1/file/2019GbRGEDVPLS.pdf" id="file-2285999-2207816">
                <date notBefore="2019-09-13"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="542103">
                <persName>
                  <forename>Mostafa</forename>
                  <surname>Darwiche</surname>
                </persName>
                <email type="md5">beccb36f5550ec07cc3144d2ee97b818</email>
                <email type="domain">gmail.com</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01579501</idno>
            <idno type="halUri">https://hal.science/hal-01579501</idno>
            <idno type="halBibtex">darwiche:hal-01579501</idno>
            <idno type="halRefHtml">&lt;i&gt;12th International workshop on Graph-Based Representation in Pattern Recognition (GbR19)&lt;/i&gt;, Jun 2019, Tours, France. pp.67-77, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-030-20081-7_7"&gt;&amp;#x27E8;10.1007/978-3-030-20081-7_7&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">12th International workshop on Graph-Based Representation in Pattern Recognition (GbR19), Jun 2019, Tours, France. pp.67-77, &amp;#x27E8;10.1007/978-3-030-20081-7_7&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-2285999-2207816"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNIV-TOURS">Université François Rabelais</idno>
            <idno type="stamp" n="LIRFAI" corresp="LIFAT">Equipe RFAI du Laboratoire Informatique de Tours</idno>
            <idno type="stamp" n="TDS-MACS">Réseau de recherche en Théorie des Systèmes Distribués, Modélisation, Analyse et Contrôle des Systèmes</idno>
            <idno type="stamp" n="ROOT-TOURS" corresp="LIFAT">Équipe Recherche Opérationnelle, Ordonnancement et Transport du Laboratoire d’Informatique de l’Université de Tours</idno>
            <idno type="stamp" n="LIFAT">Laboratoire d'Informatique Fondamentale et Appliquée de Tours</idno>
            <idno type="stamp" n="INSA-GROUPE">Groupe INSA</idno>
            <idno type="stamp" n="INSA-CVL">INSA CENTRE VAL DE LOIRE</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Solving the graph edit distance problem with variable partitioning local search</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Mostafa</forename>
                    <surname>Darwiche</surname>
                  </persName>
                  <email type="md5">beccb36f5550ec07cc3144d2ee97b818</email>
                  <email type="domain">gmail.com</email>
                  <idno type="idhal" notation="numeric">1015249</idno>
                  <idno type="halauthorid" notation="string">1214861-1015249</idno>
                  <affiliation ref="#struct-204893"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Donatello</forename>
                    <surname>Conte</surname>
                  </persName>
                  <email type="md5">52714530070d27becdfa99afcc4d3b4f</email>
                  <email type="domain">proton.me</email>
                  <idno type="idhal" notation="string">donatello-conte</idno>
                  <idno type="idhal" notation="numeric">1091</idno>
                  <idno type="halauthorid" notation="string">23549-1091</idno>
                  <idno type="IDREF">https://www.idref.fr/113061498</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-4642-4768</idno>
                  <affiliation ref="#struct-204893"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Romain</forename>
                    <surname>Raveaux</surname>
                  </persName>
                  <email type="md5">36e87faec2a0d4f1e9dca30756337294</email>
                  <email type="domain">gmail.com</email>
                  <idno type="idhal" notation="string">romain-raveaux</idno>
                  <idno type="idhal" notation="numeric">13038</idno>
                  <idno type="halauthorid" notation="string">3477-13038</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-3149-0498</idno>
                  <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=q3ou3o4AAAAJ&amp;hl=fr</idno>
                  <idno type="IDREF">https://www.idref.fr/150185243</idno>
                  <affiliation ref="#struct-204893"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Vincent</forename>
                    <surname>T'kindt</surname>
                  </persName>
                  <email type="md5">bd91ec955babf6b13971d7ca6aa5b7fb</email>
                  <email type="domain">univ-tours.fr</email>
                  <idno type="idhal" notation="string">vincent-tkindt</idno>
                  <idno type="idhal" notation="numeric">8188</idno>
                  <idno type="halauthorid" notation="string">2995821-8188</idno>
                  <idno type="IDREF">https://www.idref.fr/073272302</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-7440-2980</idno>
                  <affiliation ref="#struct-204893"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Lecture Notes in Computer Science</title>
                <meeting>
                  <title>12th International workshop on Graph-Based Representation in Pattern Recognition (GbR19)</title>
                  <date type="start">2019-06-19</date>
                  <date type="end">2019-06-21</date>
                  <settlement>Tours</settlement>
                  <country key="FR">France</country>
                </meeting>
                <editor>Donatello Conte</editor>
                <editor>Jean-Yves Ramel</editor>
                <editor>Pasquale Foggia</editor>
                <imprint>
                  <publisher>Springer</publisher>
                  <biblScope unit="serie">Graph-Based Representations in Pattern Recognition</biblScope>
                  <biblScope unit="volume">11510</biblScope>
                  <biblScope unit="pp">67-77</biblScope>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-030-20081-7_7</idno>
              <ref type="publisher">https://gbr2019.sciencesconf.org/</ref>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Graph Matching</term>
                <term xml:lang="en">Graph Edit Distance</term>
                <term xml:lang="en">Mixed Integer Linear Program</term>
                <term xml:lang="en">Variable Partitioning Local Search</term>
                <term xml:lang="en">Matheuristic</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-ro">Computer Science [cs]/Operations Research [math.OC]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>In the world of graph matching, the Graph Edit Distance (GED) problem is a well-known distance measure between graphs. It has been proven to be a NP-hard minimization problem. This paper presents an adapted version of Variable Partitioning Local Search (VPLS) matheuristic for solving the GED problem. The main idea in VPLS is to perform local searches in the solution space of a Mixed Integer Linear Program (MILP). A local earch is done in a small neighborhood defined based on a set of special variables. Those special variables are selected based on a procedure that extracts useful characteristics from the instance at hand. This actually ensures that the neighborhood contains high quality solutions. Finally, the experimentation results have shown that VPLS has outperformed existing heuristics in terms of solution quality on CMUHOUSE database.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-204893" status="VALID">
          <idno type="IdRef">081090722</idno>
          <idno type="RNSR">201220254T</idno>
          <idno type="ROR">https://ror.org/03r938j26</idno>
          <orgName>Laboratoire d'Informatique Fondamentale et Appliquée de Tours</orgName>
          <orgName type="acronym">LIFAT</orgName>
          <date type="start">2012-01-01</date>
          <desc>
            <address>
              <addrLine>64, Avenue Jean Portalis, 37200 Tours</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://lifat.univ-tours.fr/</ref>
          </desc>
          <listRelation>
            <relation name="UR6300" active="#struct-300298" type="direct"/>
            <relation active="#struct-303079" type="direct"/>
            <relation active="#struct-301232" type="indirect"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300298" status="VALID">
          <idno type="IdRef">026404478</idno>
          <idno type="ISNI">0000000121608742</idno>
          <idno type="ROR">https://ror.org/02wwzvj46</idno>
          <orgName>Université de Tours</orgName>
          <orgName type="acronym">UT</orgName>
          <date type="start">1970-12-17</date>
          <desc>
            <address>
              <addrLine>60 rue du Plat d'Étain, 37020 Tours cedex 1</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-tours.fr</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-303079" status="VALID">
          <idno type="IdRef">203592077</idno>
          <orgName>Institut National des Sciences Appliquées - Centre Val de Loire</orgName>
          <orgName type="acronym">INSA CVL</orgName>
          <date type="start">2014-01-01</date>
          <desc>
            <address>
              <addrLine>88 boulevard Lahitolle, CS 60013, 18022 Bourges cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.insa-centrevaldeloire.fr/fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-301232" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-301232" status="VALID">
          <idno type="IdRef">162105150</idno>
          <orgName>Institut National des Sciences Appliquées</orgName>
          <orgName type="acronym">INSA</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>