<?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-05051712</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-15T22:38:16+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Correcting a graph into a linegraph minimizing hamming distance edition is NP-complete and FPT by treewidth</title>
            <author role="aut">
              <persName>
                <forename type="first">Dominique</forename>
                <surname>Barth</surname>
              </persName>
              <email type="md5">9d0441ce0e7a499a175581ddf08bcef2</email>
              <email type="domain">prism.uvsq.fr</email>
              <idno type="idhal" notation="numeric">835234</idno>
              <idno type="halauthorid" notation="string">167222-835234</idno>
              <idno type="IDREF">https://www.idref.fr/078457033</idno>
              <idno type="VIAF">https://viaf.org/viaf/173151486</idno>
              <affiliation ref="#struct-456060"/>
              <affiliation ref="#struct-81173"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Dimitri</forename>
                <surname>Watel</surname>
              </persName>
              <email type="md5">155469e5fb734c11f0e38965783457c2</email>
              <email type="domain">ensiie.fr</email>
              <idno type="idhal" notation="string">dimitri-watel</idno>
              <idno type="idhal" notation="numeric">181821</idno>
              <idno type="halauthorid" notation="string">31534-181821</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-4365-1092</idno>
              <idno type="IDREF">https://www.idref.fr/184214440</idno>
              <affiliation ref="#struct-563936"/>
              <affiliation ref="#struct-1144063"/>
              <affiliation ref="#struct-179741"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Marc-Antoine</forename>
                <surname>Weisser</surname>
              </persName>
              <email type="md5">4f889ae91bb3776d33afb3350f795afd</email>
              <email type="domain">supelec.fr</email>
              <idno type="idhal" notation="string">marc-antoine-weisser</idno>
              <idno type="idhal" notation="numeric">14392</idno>
              <idno type="halauthorid" notation="string">12128-14392</idno>
              <idno type="IDREF">https://www.idref.fr/145266397</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-1006-0798</idno>
              <affiliation ref="#struct-1061259"/>
              <affiliation ref="#struct-411575"/>
              <affiliation ref="#struct-419361"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Dimitri</forename>
                <surname>Watel</surname>
              </persName>
              <email type="md5">155469e5fb734c11f0e38965783457c2</email>
              <email type="domain">ensiie.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2025-04-29 21:34:50</date>
              <date type="whenModified">2026-02-24 03:17:06</date>
              <date type="whenReleased">2025-04-30 07:36:33</date>
              <date type="whenProduced">2025-04-24</date>
              <date type="whenEndEmbargoed">2025-04-29</date>
              <ref type="file" target="https://hal.science/hal-05051712v1/document">
                <date notBefore="2025-04-29"/>
              </ref>
              <ref type="file" subtype="greenPublisher" n="1" target="https://hal.science/hal-05051712v1/file/JGAA-2024.pdf" id="file-5051712-4373769">
                <date notBefore="2025-04-29"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="182521">
                <persName>
                  <forename>Dimitri</forename>
                  <surname>Watel</surname>
                </persName>
                <email type="md5">155469e5fb734c11f0e38965783457c2</email>
                <email type="domain">ensiie.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-05051712</idno>
            <idno type="halUri">https://hal.science/hal-05051712</idno>
            <idno type="halBibtex">barth:hal-05051712</idno>
            <idno type="halRefHtml">&lt;i&gt;Journal of Graph Algorithms and Applications&lt;/i&gt;, 2025, 29 (1), pp.63-90. &lt;a target="_blank" href="https://dx.doi.org/10.7155/jgaa.v29i1.3029"&gt;&amp;#x27E8;10.7155/jgaa.v29i1.3029&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Journal of Graph Algorithms and Applications, 2025, 29 (1), pp.63-90. &amp;#x27E8;10.7155/jgaa.v29i1.3029&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-5051712-4373769"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="TELECOM-SUDPARIS" corresp="INSTITUT-MINES-TELECOM">Télécom SudParis</idno>
            <idno type="stamp" n="UVSQ">Université de Versailles Saint-Quentin-en-Yvelines</idno>
            <idno type="stamp" n="CENTRALESUPELEC">Ecole CentraleSupélec</idno>
            <idno type="stamp" n="DAVID">Données et algorithmes pour une ville intelligente et durable</idno>
            <idno type="stamp" n="UNIV-PARIS-SACLAY">Université Paris-Saclay</idno>
            <idno type="stamp" n="IP_PARIS">Institut Polytechnique de Paris</idno>
            <idno type="stamp" n="INSTITUTS-TELECOM">composantes instituts telecom </idno>
            <idno type="stamp" n="UVSQ-UPSACLAY" corresp="UNIV-PARIS-SACLAY">UVSQ-UPSACLAY</idno>
            <idno type="stamp" n="UNIVERSITE-PARIS-SACLAY" corresp="UNIV-PARIS-SACLAY">Université Paris-Saclay</idno>
            <idno type="stamp" n="LISN">Laboratoire Interdisciplinaire des Sciences du Numérique</idno>
            <idno type="stamp" n="GS-HUMANITIES-HERITAGE">Graduate School Humanités - Sciences du Patrimoine</idno>
            <idno type="stamp" n="GS-COMPUTER-SCIENCE">Graduate School Computer Science</idno>
            <idno type="stamp" n="HUB-IA">Hub Intelligence Artificielle de CentraleSupélec</idno>
            <idno type="stamp" n="ENSIIE">ENSIIE</idno>
            <idno type="stamp" n="INSTITUT-MINES-TELECOM">Institut Mines Telecom</idno>
            <idno type="stamp" n="IP-PARIS-DEPARTEMENT-MATHEMATIQUES">Département de Mathèmatiques</idno>
            <idno type="stamp" n="IP-PARIS-MATHEMATIQUES">IP Paris Département de Mathématiques</idno>
            <idno type="stamp" n="IP-PARIS-INFORMATION-COMMUNICATION-ELECTRONIQUE">IP Paris Département d'Information, de Communication et d'Électronique</idno>
            <idno type="stamp" n="IP-PARIS-INFORMATIQUE-DONNEES-ET-IA">IP Paris Département d'Informatique, de Données et d'IA</idno>
            <idno type="stamp" n="SAMOVAR">Services répartis, Architectures, Modélisation, Validation, Administration des Réseaux</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">Correcting a graph into a linegraph minimizing hamming distance edition is NP-complete and FPT by treewidth</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Dominique</forename>
                    <surname>Barth</surname>
                  </persName>
                  <email type="md5">9d0441ce0e7a499a175581ddf08bcef2</email>
                  <email type="domain">prism.uvsq.fr</email>
                  <idno type="idhal" notation="numeric">835234</idno>
                  <idno type="halauthorid" notation="string">167222-835234</idno>
                  <idno type="IDREF">https://www.idref.fr/078457033</idno>
                  <idno type="VIAF">https://viaf.org/viaf/173151486</idno>
                  <affiliation ref="#struct-456060"/>
                  <affiliation ref="#struct-81173"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Dimitri</forename>
                    <surname>Watel</surname>
                  </persName>
                  <email type="md5">155469e5fb734c11f0e38965783457c2</email>
                  <email type="domain">ensiie.fr</email>
                  <idno type="idhal" notation="string">dimitri-watel</idno>
                  <idno type="idhal" notation="numeric">181821</idno>
                  <idno type="halauthorid" notation="string">31534-181821</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-4365-1092</idno>
                  <idno type="IDREF">https://www.idref.fr/184214440</idno>
                  <affiliation ref="#struct-563936"/>
                  <affiliation ref="#struct-1144063"/>
                  <affiliation ref="#struct-179741"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Marc-Antoine</forename>
                    <surname>Weisser</surname>
                  </persName>
                  <email type="md5">4f889ae91bb3776d33afb3350f795afd</email>
                  <email type="domain">supelec.fr</email>
                  <idno type="idhal" notation="string">marc-antoine-weisser</idno>
                  <idno type="idhal" notation="numeric">14392</idno>
                  <idno type="halauthorid" notation="string">12128-14392</idno>
                  <idno type="IDREF">https://www.idref.fr/145266397</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-1006-0798</idno>
                  <affiliation ref="#struct-1061259"/>
                  <affiliation ref="#struct-411575"/>
                  <affiliation ref="#struct-419361"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">1432</idno>
                <idno type="issn">1526-1719</idno>
                <title level="j">Journal of Graph Algorithms and Applications</title>
                <imprint>
                  <publisher>Brown University</publisher>
                  <biblScope unit="volume">29</biblScope>
                  <biblScope unit="issue">1</biblScope>
                  <biblScope unit="pp">63-90</biblScope>
                  <date type="datePub">2025-04-24</date>
                  <date type="dateEpub">2025-04-24</date>
                </imprint>
              </monogr>
              <idno type="doi">10.7155/jgaa.v29i1.3029</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Linegraphs</term>
                <term xml:lang="en">Graph</term>
                <term xml:lang="en">Hypergraph</term>
                <term xml:lang="en">Graph edit distance</term>
                <term xml:lang="en">Parameterized complexity</term>
              </keywords>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</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>Since Beineke's work in 1968 on linegraphs, attention has focused on the classification of graphs as linegraphs. It is known that every graph $G$ is the linegraph of an hypergraph, and the question is to characterize that root graph. We introduce the $C_{p,q}$ classes, defined as sets of graphs where each vertex can be covered by at most $p$ cliques, and each edge belongs to at most $q$ cliques. These classes provide a comprehensive classification of linegraphs through a unified and parameterized approach. They describe previously known graph classes - such as linegraphs of simple graphs, $p$-uniform hypergraphs and $p$-uniform $1$-linear hypergraphs - while being capable of generalization. We study the complexity of determining the membership and edit distance of a graph to one of these classes. We prove the first Fixed Parameter Tractable algorithm with respect to treewidth to compute the edit distance.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-456060" status="VALID">
          <idno type="IdRef">19191620X</idno>
          <idno type="RNSR">201622145F</idno>
          <idno type="ROR">https://ror.org/01xta2p78</idno>
          <idno type="Wikidata">Q51785421</idno>
          <orgName>Données et algorithmes pour une ville intelligente et durable - DAVID</orgName>
          <orgName type="acronym">DAVID</orgName>
          <date type="start">2015-07-01</date>
          <desc>
            <address>
              <addrLine>Bâtiment Descartes — Campus des SciencesUniversité de Versailles Saint-Quentin45 avenue des États-Unis78035 Versailles</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.david.uvsq.fr/</ref>
          </desc>
          <listRelation>
            <relation name="UR 7431" active="#struct-81173" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-81173" status="VALID">
          <idno type="IdRef">03082057X</idno>
          <idno type="ISNI">0000 0001 2323 0229 </idno>
          <idno type="ROR">https://ror.org/03mkjjy25</idno>
          <orgName>Université de Versailles Saint-Quentin-en-Yvelines</orgName>
          <orgName type="acronym">UVSQ</orgName>
          <date type="start">1991-07-22</date>
          <desc>
            <address>
              <addrLine>55 avenue de Paris - 78035 Versailles cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.uvsq.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-563936" status="VALID">
          <idno type="IdRef">238327159</idno>
          <idno type="ISNI">0000000502717600</idno>
          <idno type="ROR">https://ror.org/042tfbd02</idno>
          <idno type="Wikidata">Q48759778</idno>
          <orgName>Institut Polytechnique de Paris</orgName>
          <orgName type="acronym">IP Paris</orgName>
          <date type="start">2019-06-02</date>
          <desc>
            <address>
              <addrLine>Route de Saclay, 91120 Palaiseau Cedex, France</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.ip-paris.fr</ref>
          </desc>
        </org>
        <org type="researchteam" xml:id="struct-1144063" status="VALID">
          <orgName>Statistiques, Optimisation, Probabilités</orgName>
          <orgName type="acronym">SOP - SAMOVAR</orgName>
          <date type="start">2022-10-24</date>
          <desc>
            <address>
              <addrLine>Télécom Sudparis, 9 rue Charles Fourier -91011 Evry-Courcouronnes cedex</addrLine>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-638" type="direct"/>
            <relation active="#struct-352124" type="indirect"/>
            <relation active="#struct-302102" type="indirect"/>
            <relation name="563936" active="#struct-563936" type="indirect"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-179741" status="VALID">
          <orgName>Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise</orgName>
          <orgName type="acronym">ENSIIE</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.ensiie.fr/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-1061259" status="VALID">
          <idno type="IdRef">253160316</idno>
          <idno type="RNSR">202123711L</idno>
          <idno type="ROR">https://ror.org/00rd81916</idno>
          <idno type="Wikidata">Q109620676</idno>
          <orgName>Laboratoire Interdisciplinaire des Sciences du Numérique</orgName>
          <orgName type="acronym">LISN</orgName>
          <date type="start">2021-01-01</date>
          <desc>
            <address>
              <addrLine>Campus Universitaire bât 507Rue du Belvédère91405 Orsay cedexet Campus Universitaire bât 6401 rue Raimond Castaing91190 Gif-sur-Yvette</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.lisn.upsaclay.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
            <relation active="#struct-411575" type="direct"/>
            <relation active="#struct-419361" type="direct"/>
            <relation name="UMR9015" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-411575" status="VALID">
          <idno type="IdRef">184443237</idno>
          <idno type="ROR">https://ror.org/019tcpt25</idno>
          <orgName>CentraleSupélec</orgName>
          <desc>
            <address>
              <addrLine>3, rue Joliot Curie,Plateau de Moulon,91192 GIF-SUR-YVETTE Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.centralesupelec.fr</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-419361" status="VALID">
          <idno type="IdRef">241345251</idno>
          <idno type="ROR">https://ror.org/03xjwb503</idno>
          <orgName>Université Paris-Saclay</orgName>
          <desc>
            <address>
              <addrLine>Bâtiment Bréguet, 3 Rue Joliot Curie 2e ét, 91190 Gif-sur-Yvette</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.universite-paris-saclay.fr/fr</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-638" status="VALID">
          <idno type="IdRef">281286515</idno>
          <idno type="ISNI">0000000403830480</idno>
          <idno type="RNSR">200319330C</idno>
          <orgName>Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux</orgName>
          <orgName type="acronym">SAMOVAR</orgName>
          <desc>
            <address>
              <addrLine>Télécom Sudparis, 9 rue Charles Fourier -91011 Evry cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://samovar.telecom-sudparis.eu/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-352124" type="direct"/>
            <relation active="#struct-302102" type="indirect"/>
            <relation name="563936" active="#struct-563936" type="indirect"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-352124" status="VALID">
          <idno type="IdRef">162347510</idno>
          <idno type="ISNI">0000000406406351</idno>
          <idno type="ROR">https://ror.org/05xvk4r52</idno>
          <idno type="Wikidata">Q43305</idno>
          <orgName>Télécom SudParis</orgName>
          <orgName type="acronym">TSP</orgName>
          <desc>
            <address>
              <addrLine>9 rue Charles Fourier -91011 Evry Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.telecom-sudparis.eu/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-302102" type="direct"/>
            <relation name="563936" active="#struct-563936" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-302102" status="VALID">
          <idno type="IdRef">192427156</idno>
          <idno type="ISNI">000000012202567X</idno>
          <idno type="ROR">https://ror.org/025vp2923</idno>
          <idno type="Wikidata">Q27962533</idno>
          <orgName>Institut Mines-Télécom [Paris]</orgName>
          <orgName type="acronym">IMT</orgName>
          <date type="start">2012-03-01</date>
          <desc>
            <address>
              <addrLine>19 Place Marguerite Perey, 91120 Palaiseau</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.imt.fr/</ref>
          </desc>
        </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>
      </listOrg>
    </back>
  </text>
</TEI>