<?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-01266496</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-18T19:13:09+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth and Directed Pathwidth</title>
            <author role="aut">
              <persName>
                <forename type="first">David</forename>
                <surname>Coudert</surname>
              </persName>
              <email type="md5">017b8a863d5c6a335f5520c2d5c3602e</email>
              <email type="domain">inria.fr</email>
              <ptr type="url" target="https://www-sop.inria.fr/members/David.Coudert/"/>
              <idno type="idhal" notation="string">david-coudert</idno>
              <idno type="idhal" notation="numeric">1267</idno>
              <idno type="halauthorid" notation="string">1103-1267</idno>
              <idno type="IDREF">https://www.idref.fr/074539043</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-3306-8314</idno>
              <affiliation ref="#struct-211142"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Dorian</forename>
                <surname>Mazauric</surname>
              </persName>
              <email type="md5">5d34b01b31db3910b8f71c236f14d425</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="string">dorian-mazauric</idno>
              <idno type="idhal" notation="numeric">6470</idno>
              <idno type="halauthorid" notation="string">23522-6470</idno>
              <idno type="IDREF">https://www.idref.fr/157983455</idno>
              <affiliation ref="#struct-51872"/>
            </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>David</forename>
                <surname>Coudert</surname>
              </persName>
              <email type="md5">017b8a863d5c6a335f5520c2d5c3602e</email>
              <email type="domain">inria.fr</email>
            </editor>
            <funder ref="#projanr-36354"/>
            <funder ref="#projanr-50035"/>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2016-02-02 18:25:09</date>
              <date type="whenModified">2026-01-27 16:58:02</date>
              <date type="whenReleased">2016-02-04 11:37:34</date>
              <date type="whenProduced">2016</date>
              <date type="whenEndEmbargoed">2016-02-02</date>
              <ref type="file" target="https://inria.hal.science/hal-01266496v1/document">
                <date notBefore="2016-02-02"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-01266496v1/file/babpw-20151120.pdf" id="file-1266496-1346898">
                <date notBefore="2016-02-02"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="104247">
                <persName>
                  <forename>David</forename>
                  <surname>Coudert</surname>
                </persName>
                <email type="md5">017b8a863d5c6a335f5520c2d5c3602e</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01266496</idno>
            <idno type="halUri">https://inria.hal.science/hal-01266496</idno>
            <idno type="halBibtex">coudert:hal-01266496</idno>
            <idno type="halRefHtml">&lt;i&gt;ACM Journal of Experimental Algorithmics&lt;/i&gt;, 2016, 21 (1), pp.23. &lt;a target="_blank" href="https://dx.doi.org/10.1145/2851494"&gt;&amp;#x27E8;10.1145/2851494&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">ACM Journal of Experimental Algorithmics, 2016, 21 (1), pp.23. &amp;#x27E8;10.1145/2851494&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1266496-1346898"/></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="INRIA2">INRIA 2</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="UNIV-COTEDAZUR">Université Côte d'Azur</idno>
            <idno type="stamp" n="ANR">ANR</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">Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth and Directed Pathwidth</title>
                <author role="aut">
                  <persName>
                    <forename type="first">David</forename>
                    <surname>Coudert</surname>
                  </persName>
                  <email type="md5">017b8a863d5c6a335f5520c2d5c3602e</email>
                  <email type="domain">inria.fr</email>
                  <ptr type="url" target="https://www-sop.inria.fr/members/David.Coudert/"/>
                  <idno type="idhal" notation="string">david-coudert</idno>
                  <idno type="idhal" notation="numeric">1267</idno>
                  <idno type="halauthorid" notation="string">1103-1267</idno>
                  <idno type="IDREF">https://www.idref.fr/074539043</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-3306-8314</idno>
                  <affiliation ref="#struct-211142"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Dorian</forename>
                    <surname>Mazauric</surname>
                  </persName>
                  <email type="md5">5d34b01b31db3910b8f71c236f14d425</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="string">dorian-mazauric</idno>
                  <idno type="idhal" notation="numeric">6470</idno>
                  <idno type="halauthorid" notation="string">23522-6470</idno>
                  <idno type="IDREF">https://www.idref.fr/157983455</idno>
                  <affiliation ref="#struct-51872"/>
                </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">10994</idno>
                <idno type="issn">1084-6654</idno>
                <title level="j">ACM Journal of Experimental Algorithmics</title>
                <imprint>
                  <publisher>Association for Computing Machinery</publisher>
                  <biblScope unit="volume">21</biblScope>
                  <biblScope unit="issue">1</biblScope>
                  <biblScope unit="pp">23</biblScope>
                  <date type="datePub">2016</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1145/2851494</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info.info-ni">Computer Science [cs]/Networking and Internet Architecture [cs.NI]</classCode>
              <classCode scheme="halDomain" n="info.info-ds">Computer Science [cs]/Data Structures and Algorithms [cs.DS]</classCode>
              <classCode scheme="halDomain" n="info.info-dm">Computer Science [cs]/Discrete Mathematics [cs.DM]</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>Path-decompositions of graphs are an important ingredient of dynamic programming algorithms for solving efficiently many NP-hard problems. Therefore, computing the pathwidth and associated path-decomposition of graphs has both a theoretical and practical interest. In this paper, we design a Branch and Bound algorithm that computes the exact pathwidth of graphs and a corresponding path-decomposition. Our main contribution consists of several non-trivial techniques to reduce the size of the input graph (pre-processing) and to cut the exploration space during the search phase of the algorithm. We evaluate experimentally our algorithm by comparing it to existing algorithms of the literature. It appears from the simulations that our algorithm offers a significant gain with respect to previous work. In particular, it is able to compute the exact pathwidth of any graph with less than 60 nodes in a reasonable running-time (≤ 10 minutes on a standard laptop). Moreover, our algorithm achieves good performance when used as a heuristic (i.e., when returning best result found within bounded time-limit). Our algorithm is not restricted to undirected graphs since it actually computes the directed pathwidth which generalizes the notion of pathwidth to digraphs.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <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="researchteam" xml:id="struct-51872" status="VALID">
          <idno type="RNSR">200818987H</idno>
          <idno type="ROR">https://ror.org/03ad2mf95</idno>
          <orgName>Algorithms, Biology, Structure</orgName>
          <orgName type="acronym">ABS</orgName>
          <date type="start">2008-07-08</date>
          <date type="end">2027-12-31</date>
          <desc>
            <address>
              <addrLine>2004 route des Lucioles, BP 9306902 Sophia-Antipolis</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/equipes/abs</ref>
          </desc>
          <listRelation>
            <relation active="#struct-34586" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
          </listRelation>
        </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-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="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>
      <listOrg type="projects">
        <org type="anrProject" xml:id="projanr-36354" status="VALID">
          <idno type="anr">ANR-13-BS02-0007</idno>
          <idno type="program">Blanc 2013</idno>
          <orgName>Stint</orgName>
          <desc>Structures Interdites</desc>
          <date type="start">2013</date>
        </org>
        <org type="anrProject" xml:id="projanr-50035" status="VALID">
          <idno type="anr">ANR-11-LABX-0031</idno>
          <idno type="program">Laboratoires d'excellence </idno>
          <orgName>UCN@SOPHIA</orgName>
          <desc>Réseau orienté utilisateur</desc>
          <date type="start">2011</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>