<?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-02528905</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-25T05:20:18+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">On the Complexity of Computing Treebreadth</title>
            <author role="aut">
              <persName>
                <forename type="first">Guillaume</forename>
                <surname>Ducoffe</surname>
              </persName>
              <email type="md5">69264a7f89bae18307527334c7be9e83</email>
              <email type="domain">ici.ro</email>
              <idno type="idhal" notation="string">guillaume-ducoffe</idno>
              <idno type="idhal" notation="numeric">18317</idno>
              <idno type="halauthorid" notation="string">23686-18317</idno>
              <idno type="IDREF">https://www.idref.fr/199227896</idno>
              <affiliation ref="#struct-503955"/>
              <affiliation ref="#struct-302604"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Sylvain</forename>
                <surname>Legay</surname>
              </persName>
              <email type="md5">5703023a479412c2be37b4b5e008bb0b</email>
              <email type="domain">lri.fr</email>
              <idno type="idhal" notation="numeric">978675</idno>
              <idno type="halauthorid" notation="string">311320-978675</idno>
              <idno type="IDREF">https://www.idref.fr/202447464</idno>
              <affiliation ref="#struct-1050003"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Nicolas</forename>
                <surname>Nisse</surname>
              </persName>
              <email type="md5">b73bc7bf53fc6c15e9e8581117d123f1</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="string">nicolas-nisse</idno>
              <idno type="idhal" notation="numeric">4293</idno>
              <idno type="halauthorid" notation="string">12643-4293</idno>
              <idno type="IDREF">https://www.idref.fr/119020335</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-4500-5078</idno>
              <affiliation ref="#struct-211142"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Guillaume</forename>
                <surname>Ducoffe</surname>
              </persName>
              <email type="md5">69264a7f89bae18307527334c7be9e83</email>
              <email type="domain">ici.ro</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2020-04-02 07:42:02</date>
              <date type="whenModified">2026-03-17 11:18:21</date>
              <date type="whenReleased">2020-04-02 10:15:01</date>
              <date type="whenProduced">2020</date>
              <date type="whenEndEmbargoed">2020-04-02</date>
              <ref type="file" target="https://inria.hal.science/hal-02528905v1/document">
                <date notBefore="2020-04-02"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-02528905v1/file/DLN-AlgorithmicaRevised_submitted.pdf" id="file-2528905-2399426">
                <date notBefore="2020-04-02"/>
              </ref>
              <ref type="externalLink" target="https://hal.inria.fr/hal-02528905/file/DLN-AlgorithmicaRevised_submitted.pdf"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="172029">
                <persName>
                  <forename>Guillaume</forename>
                  <surname>Ducoffe</surname>
                </persName>
                <email type="md5">69264a7f89bae18307527334c7be9e83</email>
                <email type="domain">ici.ro</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-02528905</idno>
            <idno type="halUri">https://inria.hal.science/hal-02528905</idno>
            <idno type="halBibtex">ducoffe:hal-02528905</idno>
            <idno type="halRefHtml">&lt;i&gt;Algorithmica&lt;/i&gt;, 2020, 82 (6), pp.1574-1600. &lt;a target="_blank" href="https://dx.doi.org/10.1007/s00453-019-00657-7"&gt;&amp;#x27E8;10.1007/s00453-019-00657-7&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Algorithmica, 2020, 82 (6), pp.1574-1600. &amp;#x27E8;10.1007/s00453-019-00657-7&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-2528905-2399426"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNICE">Université Nice Sophia Antipolis</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-SOPHIA">INRIA Sophia Antipolis - Méditerranée</idno>
            <idno type="stamp" n="I3S">Laboratoire d'Informatique, Signaux et Systèmes de Sophia-Antipolis</idno>
            <idno type="stamp" n="INRIASO">INRIA-SOPHIA</idno>
            <idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="TESTALAIN1">TESTALAIN1</idno>
            <idno type="stamp" n="UMR8623">Laboratoire de Recherche en Informatique</idno>
            <idno type="stamp" n="CENTRALESUPELEC">Ecole CentraleSupélec</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="UNIV-PARIS-SACLAY">Université Paris-Saclay</idno>
            <idno type="stamp" n="UNIV-COTEDAZUR">Université Côte d'Azur</idno>
            <idno type="stamp" n="TEST-HALCNRS">Collection test HAL CNRS</idno>
            <idno type="stamp" n="UNIVERSITE-PARIS-SACLAY" corresp="UNIV-PARIS-SACLAY">Université Paris-Saclay</idno>
            <idno type="stamp" n="GS-LIFE-SCIENCES-HEALTH" corresp="UNIVERSITE-PARIS-SACLAY">Graduate School Life Sciences and Health</idno>
            <idno type="stamp" n="INRIAARTDOI">INRIAARTDOI</idno>
            <idno type="stamp" n="TEST-NICE">test nice</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">On the Complexity of Computing Treebreadth</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Guillaume</forename>
                    <surname>Ducoffe</surname>
                  </persName>
                  <email type="md5">69264a7f89bae18307527334c7be9e83</email>
                  <email type="domain">ici.ro</email>
                  <idno type="idhal" notation="string">guillaume-ducoffe</idno>
                  <idno type="idhal" notation="numeric">18317</idno>
                  <idno type="halauthorid" notation="string">23686-18317</idno>
                  <idno type="IDREF">https://www.idref.fr/199227896</idno>
                  <affiliation ref="#struct-503955"/>
                  <affiliation ref="#struct-302604"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Sylvain</forename>
                    <surname>Legay</surname>
                  </persName>
                  <email type="md5">5703023a479412c2be37b4b5e008bb0b</email>
                  <email type="domain">lri.fr</email>
                  <idno type="idhal" notation="numeric">978675</idno>
                  <idno type="halauthorid" notation="string">311320-978675</idno>
                  <idno type="IDREF">https://www.idref.fr/202447464</idno>
                  <affiliation ref="#struct-1050003"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Nicolas</forename>
                    <surname>Nisse</surname>
                  </persName>
                  <email type="md5">b73bc7bf53fc6c15e9e8581117d123f1</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="string">nicolas-nisse</idno>
                  <idno type="idhal" notation="numeric">4293</idno>
                  <idno type="halauthorid" notation="string">12643-4293</idno>
                  <idno type="IDREF">https://www.idref.fr/119020335</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-4500-5078</idno>
                  <affiliation ref="#struct-211142"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">10334</idno>
                <idno type="issn">0178-4617</idno>
                <idno type="eissn">1432-0541</idno>
                <title level="j">Algorithmica</title>
                <imprint>
                  <publisher>Springer Verlag</publisher>
                  <biblScope unit="volume">82</biblScope>
                  <biblScope unit="issue">6</biblScope>
                  <biblScope unit="pp">1574-1600</biblScope>
                  <date type="datePub">2020</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/s00453-019-00657-7</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info.info-cc">Computer Science [cs]/Computational Complexity [cs.CC]</classCode>
              <classCode scheme="halDomain" n="info.info-ds">Computer Science [cs]/Data Structures and Algorithms [cs.DS]</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>During the last decade, metric properties of the bags of tree decompositions of graphs have been studied. Roughly, the length and the breadth of a tree decomposition are the maximum diameter and radius of its bags respectively. The treelength and the treebreadth of a graph are the minimum length and breadth of its tree decompositions respectively. Pathlength and pathbreadth are defined similarly for path decompositions. In this paper, we answer open questions of [Dragan and Köhler, Algorithmica 2014] and [Dragan, Köhler and Leitert, SWAT 2014] about the computational complexity of treebreadth, pathbreadth and pathlength. Namely, we prove that computing these graph invariants is NP-hard. We further investigate graphs with treebreadth one, i.e., graphs that admit a tree decomposition where each bag has a dominating vertex. We show that it is NP-complete to decide whether a graph belongs to this class. We then prove some structural properties of such graphs which allows us to design polynomial-time algorithms to decide whether a bipartite graph, resp., a planar graph (or more generally, a triangle-free graph, resp., a K 3,3-minor-free graph), has treebreadth one.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-503955" status="VALID">
          <idno type="ROR">https://ror.org/028rq5v79</idno>
          <orgName>National Institute for Research and Development in Informatics [Bucharest]</orgName>
          <orgName type="acronym">ICI</orgName>
          <desc>
            <address>
              <addrLine>8-10, Mareşal Averescu, 011455, Bucharest</addrLine>
              <country key="RO"/>
            </address>
            <ref type="url">https://www.ici.ro/?lang=en</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-302604" status="VALID">
          <idno type="ROR">https://ror.org/02x2v6p15</idno>
          <orgName>University of Bucharest</orgName>
          <orgName type="acronym">UniBuc</orgName>
          <desc>
            <address>
              <addrLine>90, Panduri Street, Sector 5, 050663, Bucharest</addrLine>
              <country key="RO"/>
            </address>
            <ref type="url">http://www.unibuc.ro/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-1050003" status="OLD">
          <idno type="RNSR">199812948M</idno>
          <orgName>Laboratoire de Recherche en Informatique</orgName>
          <orgName type="acronym">LRI</orgName>
          <date type="start">2020-01-01</date>
          <date type="end">2020-12-31</date>
          <desc>
            <address>
              <addrLine>LRI - Bâtiments 650-660 Université Paris-Saclay 91405 Orsay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lri.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-411575" type="direct"/>
            <relation active="#struct-419361" type="direct"/>
            <relation name="UMR8623" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-211142" status="VALID">
          <idno type="RNSR">201322124W</idno>
          <idno type="ROR">https://ror.org/02mab7455</idno>
          <orgName>Combinatorics, Optimization and Algorithms for Telecommunications</orgName>
          <orgName type="acronym">COATI</orgName>
          <date type="start">2013-01-01</date>
          <date type="end">2026-04-30</date>
          <desc>
            <address>
              <addrLine>2004 route des Lucioles BP 93 F-06902 Sophia Antipolis (France)</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/equipes/coati</ref>
          </desc>
          <listRelation>
            <relation active="#struct-34586" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-451999" type="direct"/>
            <relation active="#struct-13009" type="indirect"/>
            <relation active="#struct-117617" type="indirect"/>
            <relation name="UMR7271" active="#struct-441569" type="indirect"/>
            <relation active="#struct-1039632" type="indirect"/>
          </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="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-34586" status="VALID">
          <idno type="RNSR">198318250R</idno>
          <idno type="ROR">https://ror.org/01nzkaw91</idno>
          <orgName>Centre Inria d'Université Côte d'Azur</orgName>
          <desc>
            <address>
              <addrLine>2004 route des Lucioles BP 93 06902 Sophia Antipolis</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre/sophia/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" 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="department" xml:id="struct-451999" status="VALID">
          <orgName>COMmunications, Réseaux, systèmes Embarqués et Distribués</orgName>
          <orgName type="acronym">Laboratoire I3S - COMRED</orgName>
          <date type="start">2016-03-02</date>
          <desc>
            <address>
              <addrLine>Laboratoire I3SCS 4012106903 Sophia Antipolis Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.i3s.unice.fr/comred</ref>
          </desc>
          <listRelation>
            <relation active="#struct-13009" type="direct"/>
            <relation active="#struct-117617" type="indirect"/>
            <relation name="UMR7271" active="#struct-441569" type="indirect"/>
            <relation active="#struct-1039632" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-13009" status="VALID">
          <idno type="IdRef">050320491</idno>
          <idno type="ISNI">0000000105613840</idno>
          <idno type="RNSR">201220432L</idno>
          <idno type="ROR">https://ror.org/01215r597</idno>
          <orgName>Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis</orgName>
          <orgName type="acronym">I3S</orgName>
          <desc>
            <address>
              <addrLine>2000, route des Lucioles - Les Algorithmes - bât. Euclide B 06900 Sophia Antipolis</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.i3s.unice.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-117617" type="direct"/>
            <relation name="UMR7271" active="#struct-441569" type="direct"/>
            <relation active="#struct-1039632" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-117617" status="VALID">
          <idno type="IdRef">026403498</idno>
          <idno type="ISNI">0000000123372892</idno>
          <idno type="ROR">https://ror.org/02k9vew78</idno>
          <orgName>Université Nice Sophia Antipolis (1965 - 2019)</orgName>
          <orgName type="acronym">UNS</orgName>
          <date type="start">1965-10-23</date>
          <date type="end">2019-12-31</date>
          <desc>
            <address>
              <addrLine>Parc Valrose, 06100 Nice</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://unice.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-1039632" status="VALID">
          <idno type="IdRef">241035694</idno>
          <idno type="ROR">https://ror.org/019tgvf94</idno>
          <orgName>Université Côte d'Azur</orgName>
          <orgName type="acronym">UniCA</orgName>
          <date type="start">2020-01-01</date>
          <desc>
            <address>
              <addrLine>Parc Valrose, 28, avenue Valrose 06108 Nice Cedex 2</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://univ-cotedazur.fr</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>