<?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-00512284</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:21+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Minimum number of wavelengths equals load in a DAG without internal cycle</title>
            <author role="aut">
              <persName>
                <forename type="first">Jean-Claude</forename>
                <surname>Bermond</surname>
              </persName>
              <email type="md5">6152b43c5dee4ff74e213a261cfe369d</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="string">jean-claude-bermond</idno>
              <idno type="idhal" notation="numeric">739520</idno>
              <idno type="halauthorid" notation="string">13047-739520</idno>
              <idno type="ORCID">https://orcid.org/0009-0001-0454-0050</idno>
              <idno type="IDREF">https://www.idref.fr/032696256</idno>
              <affiliation ref="#struct-2466"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Michel</forename>
                <surname>Cosnard</surname>
              </persName>
              <email type="md5">b9f5c405b8d62cde9ad7fa2ad870ec59</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="string">michel-cosnard</idno>
              <idno type="idhal" notation="numeric">950781</idno>
              <idno type="halauthorid" notation="string">425012-950781</idno>
              <idno type="ORCID">https://orcid.org/0009-0004-1386-9001</idno>
              <orgName ref="#struct-300009"/>
              <affiliation ref="#struct-2466"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Jean-Claude</forename>
                <surname>Bermond</surname>
              </persName>
              <email type="md5">6152b43c5dee4ff74e213a261cfe369d</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2010-08-29 18:32:04</date>
              <date type="whenWritten">2007</date>
              <date type="whenModified">2025-10-07 15:32:02</date>
              <date type="whenReleased">2010-08-30 08:35:20</date>
              <date type="whenProduced">2007-03</date>
              <date type="whenEndEmbargoed">2010-08-29</date>
              <ref type="file" target="https://hal.science/hal-00512284v1/document">
                <date notBefore="2010-08-29"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-00512284v1/file/BC07.pdf" id="file-512284-230695">
                <date notBefore="2010-08-29"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="120344">
                <persName>
                  <forename>Jean-Claude</forename>
                  <surname>Bermond</surname>
                </persName>
                <email type="md5">6152b43c5dee4ff74e213a261cfe369d</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-00512284</idno>
            <idno type="halUri">https://hal.science/hal-00512284</idno>
            <idno type="halBibtex">bermond:hal-00512284</idno>
            <idno type="halRefHtml">&lt;i&gt;IPDPS07&lt;/i&gt;, Mar 2007, Long beach, CA, United States. pp.1-10</idno>
            <idno type="halRef">IPDPS07, Mar 2007, Long beach, CA, United States. pp.1-10</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-512284-230695"/></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="INRIA-300009">Inria 300009</idno>
            <idno type="stamp" n="TEST-NICE">test nice</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">Minimum number of wavelengths equals load in a DAG without internal cycle</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Jean-Claude</forename>
                    <surname>Bermond</surname>
                  </persName>
                  <email type="md5">6152b43c5dee4ff74e213a261cfe369d</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="string">jean-claude-bermond</idno>
                  <idno type="idhal" notation="numeric">739520</idno>
                  <idno type="halauthorid" notation="string">13047-739520</idno>
                  <idno type="ORCID">https://orcid.org/0009-0001-0454-0050</idno>
                  <idno type="IDREF">https://www.idref.fr/032696256</idno>
                  <affiliation ref="#struct-2466"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Michel</forename>
                    <surname>Cosnard</surname>
                  </persName>
                  <email type="md5">b9f5c405b8d62cde9ad7fa2ad870ec59</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="string">michel-cosnard</idno>
                  <idno type="idhal" notation="numeric">950781</idno>
                  <idno type="halauthorid" notation="string">425012-950781</idno>
                  <idno type="ORCID">https://orcid.org/0009-0004-1386-9001</idno>
                  <orgName ref="#struct-300009"/>
                  <affiliation ref="#struct-2466"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Parallel and Distributed Processing Symposium, 2007.</title>
                <meeting>
                  <title>IPDPS07</title>
                  <date type="start">2007-03</date>
                  <date type="end">2007-03</date>
                  <settlement>Long beach, CA</settlement>
                  <country key="US">United States</country>
                </meeting>
                <editor>IEEE</editor>
                <imprint>
                  <biblScope unit="pp">1-10</biblScope>
                  <date type="datePub">2007-03</date>
                </imprint>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info.info-dm">Computer Science [cs]/Discrete Mathematics [cs.DM]</classCode>
              <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="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>Let P be a family of dipaths. The load of an arc is the number of dipaths containing this arc. Let (G,P) be the maximum of the load of all the arcs and let w(G,P) be the minimum number of wavelengths (colors) needed to color the family of dipathsP in such a way that two dipaths with the same wavelength are arc-disjoint. Let G be a DAG (Directed Acyclic Graph). An internal cycle is an oriented cycle such that all the vertices have at least one predecessor and one successor in G (said otherwise every cycle contain neither a source nor a sink of G). Here we prove that if G is a DAG without internal cycle, then for any family of dipaths P, w(G,P) = (G,P). On the opposite we give examples of DAGs with internal cycles such that the ratio between w(G,P) and (G,P) cannot be bounded. We also consider an apparently new class of DAGs, which is of interest in itself, those for which there is at most one dipath from a vertex to another. We call these digraphs UPP-DAGs. For these UPP-DAGs we show that the load is equal to the maximum size of a clique of the conflict graph. We show that if an UPP-DAG has only one internal cycle, then for any family of dipaths w(G,P) = 4 3(G,P) and we exhibit an UPP-DAG and a family of dipaths reaching the bound. We conjecture that the ratio between w(G,P) and (G,P) cannot be bounded.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-2466" status="OLD">
          <idno type="RNSR">200018393X</idno>
          <orgName>Algorithms, simulation, combinatorics and optimization for telecommunications</orgName>
          <orgName type="acronym">MASCOTTE</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </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="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>
    </back>
  </text>
</TEI>