<?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-00433567</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-04-26T12:25:01+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">A path following algorithm for the graph matching problem.</title>
            <author role="aut">
              <persName>
                <forename type="first">Mikhail</forename>
                <surname>Zaslavskiy</surname>
              </persName>
              <idno type="halauthorid">282809-0</idno>
              <affiliation ref="#struct-206"/>
              <affiliation ref="#struct-21326"/>
              <affiliation ref="#struct-46211"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Francis</forename>
                <surname>Bach</surname>
              </persName>
              <email type="md5">680cc09c1c0374b69b5db968da45c886</email>
              <email type="domain">mines.org</email>
              <idno type="idhal" notation="numeric">863086</idno>
              <idno type="halauthorid" notation="string">220198-863086</idno>
              <idno type="IDREF">https://www.idref.fr/152166203</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-8644-1058</idno>
              <idno type="VIAF">https://viaf.org/viaf/300318257</idno>
              <idno type="ISNI">http://isni.org/isni/0000000403490543</idno>
              <affiliation ref="#struct-98463"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Jean-Philippe</forename>
                <surname>Vert</surname>
              </persName>
              <email type="md5">2fc098cd12d42d1e76510329e12b2a93</email>
              <email type="domain">mines.org</email>
              <idno type="idhal" notation="string">jean-philippe-vert</idno>
              <idno type="idhal" notation="numeric">10276</idno>
              <idno type="halauthorid" notation="string">30643-10276</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-9510-8441</idno>
              <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=pqpxh7IAAAAJ</idno>
              <idno type="IDREF">https://www.idref.fr/122407385</idno>
              <affiliation ref="#struct-21326"/>
              <affiliation ref="#struct-46211"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Jean-Philippe</forename>
                <surname>Vert</surname>
              </persName>
              <email type="md5">2fc098cd12d42d1e76510329e12b2a93</email>
              <email type="domain">mines.org</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2009-11-19 23:38:12</date>
              <date type="whenModified">2026-01-09 09:48:30</date>
              <date type="whenReleased">2009-11-19 23:38:12</date>
              <date type="whenProduced">2009-12</date>
              <ref type="externalLink" target="http://arxiv.org/pdf/0801.3654"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="100104">
                <persName>
                  <forename>Jean-Philippe</forename>
                  <surname>Vert</surname>
                </persName>
                <email type="md5">2fc098cd12d42d1e76510329e12b2a93</email>
                <email type="domain">mines.org</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-00433567</idno>
            <idno type="halUri">https://hal.science/hal-00433567</idno>
            <idno type="halBibtex">zaslavskiy:hal-00433567</idno>
            <idno type="halRefHtml">&lt;i&gt;IEEE Transactions on Pattern Analysis and Machine Intelligence&lt;/i&gt;, 2009, 31 (12), pp.2227-42. &lt;a target="_blank" href="https://dx.doi.org/10.1109/TPAMI.2008.245"&gt;&amp;#x27E8;10.1109/TPAMI.2008.245&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">IEEE Transactions on Pattern Analysis and Machine Intelligence, 2009, 31 (12), pp.2227-42. &amp;#x27E8;10.1109/TPAMI.2008.245&amp;#x27E9;</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="ENSMP" corresp="PARISTECH">MINES ParisTech</idno>
            <idno type="stamp" n="ENS-PARIS">Ecole Normale Supérieure de Paris</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="INRIA-ROCQ">INRIA Paris - Rocquencourt</idno>
            <idno type="stamp" n="ENSMP_CBIO" corresp="ENSMP">Bio-informatique (CBIO)</idno>
            <idno type="stamp" n="ENSMP_CMM" corresp="ENSMP">Morphologie mathématique (CMM)</idno>
            <idno type="stamp" n="PARISTECH">ParisTech</idno>
            <idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="FNCLCC" corresp="INSERM">UNICANCER</idno>
            <idno type="stamp" n="CURIE" corresp="INSERM">Institut Curie</idno>
            <idno type="stamp" n="TESTALAIN1">TESTALAIN1</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="PSL">Université Paris sciences et lettres</idno>
            <idno type="stamp" n="INRIA-PSL">INRIA-PSL</idno>
            <idno type="stamp" n="ENSMP_DEP_MS">Département Mathématiques et systèmes</idno>
            <idno type="stamp" n="ENSMP_DR" corresp="ENSMP">ENSMP_DR</idno>
            <idno type="stamp" n="ENSMP-PSL" corresp="PSL">MINES ParisTech - École nationale supérieure des mines de Paris - PSL</idno>
            <idno type="stamp" n="ENS-PSL" corresp="PSL">École normale supérieure - PSL</idno>
            <idno type="stamp" n="INSTITUT-CURIE-PSL" corresp="PSL">Institut Curie - PSL</idno>
            <idno type="stamp" n="TEST3-HALCNRS">TEST3-HALCNRS</idno>
            <idno type="stamp" n="DIENS" corresp="ENS-PARIS">Département d'informatique de l'ENS-PSL</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">A path following algorithm for the graph matching problem.</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Mikhail</forename>
                    <surname>Zaslavskiy</surname>
                  </persName>
                  <idno type="halauthorid">282809-0</idno>
                  <affiliation ref="#struct-206"/>
                  <affiliation ref="#struct-21326"/>
                  <affiliation ref="#struct-46211"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Francis</forename>
                    <surname>Bach</surname>
                  </persName>
                  <email type="md5">680cc09c1c0374b69b5db968da45c886</email>
                  <email type="domain">mines.org</email>
                  <idno type="idhal" notation="numeric">863086</idno>
                  <idno type="halauthorid" notation="string">220198-863086</idno>
                  <idno type="IDREF">https://www.idref.fr/152166203</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-8644-1058</idno>
                  <idno type="VIAF">https://viaf.org/viaf/300318257</idno>
                  <idno type="ISNI">http://isni.org/isni/0000000403490543</idno>
                  <affiliation ref="#struct-98463"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Jean-Philippe</forename>
                    <surname>Vert</surname>
                  </persName>
                  <email type="md5">2fc098cd12d42d1e76510329e12b2a93</email>
                  <email type="domain">mines.org</email>
                  <idno type="idhal" notation="string">jean-philippe-vert</idno>
                  <idno type="idhal" notation="numeric">10276</idno>
                  <idno type="halauthorid" notation="string">30643-10276</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-9510-8441</idno>
                  <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=pqpxh7IAAAAJ</idno>
                  <idno type="IDREF">https://www.idref.fr/122407385</idno>
                  <affiliation ref="#struct-21326"/>
                  <affiliation ref="#struct-46211"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">5390</idno>
                <idno type="issn">0162-8828</idno>
                <title level="j">IEEE Transactions on Pattern Analysis and Machine Intelligence</title>
                <imprint>
                  <publisher>Institute of Electrical and Electronics Engineers</publisher>
                  <biblScope unit="volume">31</biblScope>
                  <biblScope unit="issue">12</biblScope>
                  <biblScope unit="pp">2227-42</biblScope>
                  <date type="datePub">2009-12</date>
                </imprint>
              </monogr>
              <idno type="arxiv">0801.3654</idno>
              <idno type="doi">10.1109/TPAMI.2008.245</idno>
              <idno type="pubmed">19834143</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info.info-ds">Computer Science [cs]/Data Structures and Algorithms [cs.DS]</classCode>
              <classCode scheme="halDomain" n="info.info-lg">Computer Science [cs]/Machine Learning [cs.LG]</classCode>
              <classCode scheme="halDomain" n="info.info-ti">Computer Science [cs]/Image Processing [eess.IV]</classCode>
              <classCode scheme="halDomain" n="sdv.bibs">Life Sciences [q-bio]/Quantitative Methods [q-bio.QM]</classCode>
              <classCode scheme="halDomain" n="info.info-bi">Computer Science [cs]/Bioinformatics [q-bio.QM]</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted graph matching problem as a least-square problem on the set of permutation matrices and relaxing it to two different optimization problems: a quadratic convex and a quadratic concave optimization problem on the set of doubly stochastic matrices. The concave relaxation has the same global minimum as the initial graph matching problem, but the search for its global minimum is also a hard combinatorial problem. We, therefore, construct an approximation of the concave problem solution by following a solution path of a convex-concave problem obtained by linear interpolation of the convex and concave formulations, starting from the convex relaxation. This method allows to easily integrate the information on graph label similarities into the optimization problem, and therefore, perform labeled weighted graph matching. The algorithm is compared with some of the best performing graph matching methods on four data sets: simulated graphs, QAPLib, retina vessel images, and handwritten Chinese characters. In all cases, the results are competitive with the state of the art.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-206" status="VALID">
          <idno type="IdRef">15213493X</idno>
          <idno type="ROR">https://ror.org/0579t4s85</idno>
          <orgName>Centre de Morphologie Mathématique</orgName>
          <orgName type="acronym">CMM</orgName>
          <date type="end">2025-12-31</date>
          <desc>
            <address>
              <addrLine>35 rue Saint-Honoré 77305 Fontainebleau cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://cmm.mines-paristech.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-301492" type="direct"/>
            <relation active="#struct-564132" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-21326" status="VALID">
          <idno type="IdRef">152350985</idno>
          <idno type="RNSR">200818048M</idno>
          <idno type="ROR">https://ror.org/00c00ys31</idno>
          <orgName>Centre de Bioinformatique</orgName>
          <orgName type="acronym">CBIO</orgName>
          <date type="start">2006-01-01</date>
          <desc>
            <address>
              <addrLine>60, Boulevard Saint Michel, 75006 PARIS</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://cbio.mines-paristech.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-301492" type="direct"/>
            <relation active="#struct-564132" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-46211" status="VALID">
          <idno type="ROR">https://ror.org/0095dt357</idno>
          <orgName>Cancer et génome: Bioinformatique, biostatistiques et épidémiologie d'un système complexe</orgName>
          <desc>
            <address>
              <addrLine>26 rue d'Ulm - 75248 Paris cedex 05</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://science.curie.fr/recherche/biologie-interactive-des-tumeurs-immunologie-environnement/c/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-301492" type="direct"/>
            <relation active="#struct-564132" type="indirect"/>
            <relation active="#struct-301888" type="direct"/>
            <relation name="U900" active="#struct-303623" type="direct"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-98463" status="OLD">
          <idno type="RNSR">200718311C</idno>
          <orgName>Models of visual object recognition and scene understanding</orgName>
          <orgName type="acronym">WILLOW</orgName>
          <date type="end">2015-12-31</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/equipes/willow</ref>
          </desc>
          <listRelation>
            <relation active="#struct-25027" type="direct"/>
            <relation active="#struct-59704" type="indirect"/>
            <relation active="#struct-564132" type="indirect"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation name="UMR8548" active="#struct-441569" type="direct"/>
            <relation active="#struct-86790" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-301492" status="VALID">
          <idno type="IdRef">026375249</idno>
          <idno type="ROR">https://ror.org/04y8cs423</idno>
          <orgName>Mines Paris - PSL (École nationale supérieure des mines de Paris)</orgName>
          <date type="start">1783-01-01</date>
          <desc>
            <address>
              <addrLine>60, boulevard Saint-Michel 75006 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.minesparis.psl.eu/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-564132" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-564132" status="VALID">
          <idno type="IdRef">241597595</idno>
          <idno type="ISNI">0000 0004 1784 3645</idno>
          <idno type="ROR">https://ror.org/013cjyk83</idno>
          <orgName>Université Paris Sciences et Lettres</orgName>
          <orgName type="acronym">PSL</orgName>
          <desc>
            <address>
              <addrLine>60 rue Mazarine 75006 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.psl.eu/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-301888" status="VALID">
          <idno type="ISNI">0000 0004 0639 6384</idno>
          <idno type="ROR">https://ror.org/04t0gwh46</idno>
          <orgName>Institut Curie [Paris]</orgName>
          <desc>
            <address>
              <addrLine>26 rue d'Ulm - 75248 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://science.curie.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-303623" status="VALID">
          <idno type="IdRef">026388278</idno>
          <idno type="ROR">https://ror.org/02vjkv261</idno>
          <orgName>Institut National de la Santé et de la Recherche Médicale</orgName>
          <orgName type="acronym">INSERM</orgName>
          <desc>
            <address>
              <addrLine>101, rue de Tolbiac, 75013 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inserm.fr</ref>
          </desc>
        </org>
        <org type="regrouplaboratory" xml:id="struct-25027" status="VALID">
          <idno type="IdRef">148034055</idno>
          <idno type="RNSR">199812876J</idno>
          <idno type="ROR">05y6rqs46</idno>
          <orgName>Département d'informatique - ENS-PSL</orgName>
          <orgName type="acronym">DI-ENS</orgName>
          <date type="start">1999-01-01</date>
          <desc>
            <address>
              <addrLine>École normale supérieure 45 rue d'Ulm F-75230 Paris Cedex 05</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.di.ens.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-59704" type="direct"/>
            <relation active="#struct-564132" type="indirect"/>
            <relation active="#struct-300009" type="direct"/>
            <relation name="UMR8548" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-59704" status="VALID">
          <idno type="IdRef">031738419</idno>
          <idno type="ISNI">0000000123532622</idno>
          <idno type="ROR">https://ror.org/05a0dhs15</idno>
          <orgName>École normale supérieure - Paris</orgName>
          <orgName type="acronym">ENS-PSL</orgName>
          <date type="start">1985-07-24</date>
          <desc>
            <address>
              <addrLine>45, Rue d'Ulm - 75230 Paris cedex 05</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.ens.psl.eu/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-564132" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300009" status="VALID">
          <idno type="ROR">https://ror.org/02kvxyf05</idno>
          <orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
          <orgName type="acronym">Inria</orgName>
          <desc>
            <address>
              <addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/en/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-86790" status="OLD">
          <orgName>Inria Paris-Rocquencourt</orgName>
          <date type="end">2016-03-30</date>
          <desc>
            <address>
              <addrLine>INRIA Rocquencourt : Domaine de Voluceau, Rocquencourt B.P. 105 78153 le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre/paris-rocquencourt</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
          </listRelation>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>