<?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-03655680</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-13T14:50:41+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">The Largest Connected Subgraph Game</title>
            <author role="aut">
              <persName>
                <forename type="first">Julien</forename>
                <surname>Bensmail</surname>
              </persName>
              <idno type="halauthorid">584927-0</idno>
              <affiliation ref="#struct-211142"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Foivos</forename>
                <surname>Fioravantes</surname>
              </persName>
              <email type="md5">aa9ec1b8e7ae574165cf06bb9407a551</email>
              <email type="domain">gmail.com</email>
              <idno type="idhal" notation="string">foivos-fioravantes</idno>
              <idno type="idhal" notation="numeric">1200729</idno>
              <idno type="halauthorid" notation="string">1629026-1200729</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-8217-030X</idno>
              <affiliation ref="#struct-211142"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Fionn</forename>
                <surname>Mc Inerney</surname>
              </persName>
              <email type="md5">9823ac5a7d27b9767d815135744a6ef9</email>
              <email type="domain">gmail.com</email>
              <idno type="idhal" notation="string">fionn-mc-inerney</idno>
              <idno type="idhal" notation="numeric">734680</idno>
              <idno type="halauthorid" notation="string">33891-734680</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-5634-9506</idno>
              <affiliation ref="#struct-573058"/>
            </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>Nicolas</forename>
                <surname>Nisse</surname>
              </persName>
              <email type="md5">b73bc7bf53fc6c15e9e8581117d123f1</email>
              <email type="domain">inria.fr</email>
            </editor>
            <funder ref="#projanr-50864"/>
            <funder ref="#projanr-49542"/>
            <funder ref="#projeurop-713421"/>
            <funder>projet SticAm-Sud Galop</funder>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2022-04-29 19:22:08</date>
              <date type="whenModified">2026-02-07 05:23:08</date>
              <date type="whenReleased">2022-05-02 10:18:06</date>
              <date type="whenProduced">2022</date>
              <date type="whenEndEmbargoed">2022-04-29</date>
              <ref type="file" target="https://hal.science/hal-03655680v1/document">
                <date notBefore="2022-04-29"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-03655680v1/file/The_Largest_Connected_Subgraph_Game.pdf" id="file-3655680-3192540">
                <date notBefore="2022-04-29"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="120410">
                <persName>
                  <forename>Nicolas</forename>
                  <surname>Nisse</surname>
                </persName>
                <email type="md5">b73bc7bf53fc6c15e9e8581117d123f1</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-03655680</idno>
            <idno type="halUri">https://hal.science/hal-03655680</idno>
            <idno type="halBibtex">bensmail:hal-03655680</idno>
            <idno type="halRefHtml">&lt;i&gt;Algorithmica&lt;/i&gt;, 2022, 84 (9), pp.1030-1063. &lt;a target="_blank" href="https://dx.doi.org/10.1007/s00453-022-00973-5"&gt;&amp;#x27E8;10.1007/s00453-022-00973-5&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Algorithmica, 2022, 84 (9), pp.1030-1063. &amp;#x27E8;10.1007/s00453-022-00973-5&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-3655680-3192540"/></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="OPENAIRE">OpenAIRE</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="IDEX-UNIV-COTEDAZUR">IDEX Université Côte d'Azur</idno>
            <idno type="stamp" n="ANR">ANR</idno>
            <idno type="stamp" n="INRIA-ALLEMAGNE">INRIA-ALLEMAGNE</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">The Largest Connected Subgraph Game</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Julien</forename>
                    <surname>Bensmail</surname>
                  </persName>
                  <idno type="halauthorid">584927-0</idno>
                  <affiliation ref="#struct-211142"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Foivos</forename>
                    <surname>Fioravantes</surname>
                  </persName>
                  <email type="md5">aa9ec1b8e7ae574165cf06bb9407a551</email>
                  <email type="domain">gmail.com</email>
                  <idno type="idhal" notation="string">foivos-fioravantes</idno>
                  <idno type="idhal" notation="numeric">1200729</idno>
                  <idno type="halauthorid" notation="string">1629026-1200729</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-8217-030X</idno>
                  <affiliation ref="#struct-211142"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Fionn</forename>
                    <surname>Mc Inerney</surname>
                  </persName>
                  <email type="md5">9823ac5a7d27b9767d815135744a6ef9</email>
                  <email type="domain">gmail.com</email>
                  <idno type="idhal" notation="string">fionn-mc-inerney</idno>
                  <idno type="idhal" notation="numeric">734680</idno>
                  <idno type="halauthorid" notation="string">33891-734680</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-5634-9506</idno>
                  <affiliation ref="#struct-573058"/>
                </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">84</biblScope>
                  <biblScope unit="issue">9</biblScope>
                  <biblScope unit="pp">1030-1063</biblScope>
                  <date type="datePub">2022</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/s00453-022-00973-5</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">PSPACE-complete</term>
                <term xml:lang="en">Connection games</term>
                <term xml:lang="en">Scoring games</term>
                <term xml:lang="en">Games on graphs</term>
                <term xml:lang="en">GI-hard</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-dm">Computer Science [cs]/Discrete Mathematics [cs.DM]</classCode>
              <classCode scheme="halDomain" n="info.info-cc">Computer Science [cs]/Computational Complexity [cs.CC]</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>This paper introduces the largest connected subgraph game played on an undirected graph G. In each round, Alice first colours an uncoloured vertex of G red, and then, Bob colours an uncoloured vertex of G blue, with all vertices initially uncoloured. Once all the vertices are coloured, Alice (Bob, resp.) wins if there is a red (blue, resp.) connected subgraph whose order is greater than the order of any blue (red, resp.) connected subgraph. We first prove that, if Alice plays optimally, then Bob can never win, and define a large class of graphs (called reflection graphs) in which the game is a draw. We then show that determining the outcome of the game is PSPACE-complete, even in bipartite graphs of small diameter, and that recognising reflection graphs is GI-hard. We also prove that the game is a draw in paths if and only if the path is of even order or has at least 11 vertices, and that Alice wins in cycles if and only if the cycle is of odd length. Lastly, we give an algorithm to determine the outcome of the game in cographs in linear time.</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="institution" xml:id="struct-573058" status="VALID">
          <idno type="ROR">https://ror.org/02njgxr09</idno>
          <orgName>Helmholtz Center for Information Security [Saarbrücken]</orgName>
          <orgName type="acronym">CISPA</orgName>
          <desc>
            <address>
              <addrLine>Stuhlsatzenhaus 566123 Saarbrücken</addrLine>
              <country key="DE"/>
            </address>
            <ref type="url">https://cispa.saarland/</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-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-50864" status="VALID">
          <idno type="anr">ANR-15-IDEX-0001</idno>
          <orgName>UCA JEDI</orgName>
          <desc>Idex UCA JEDI</desc>
          <date type="start">2015</date>
        </org>
        <org type="anrProject" xml:id="projanr-49542" status="VALID">
          <idno type="anr">ANR-17-EURE-0004</idno>
          <orgName>UCA DS4H</orgName>
          <desc>UCA Systèmes Numériques pour l'Homme</desc>
          <date type="start">2017</date>
        </org>
        <org type="europeanProject" xml:id="projeurop-713421" status="VALID">
          <idno type="number">725978</idno>
          <idno type="program">ERC-2016-COG</idno>
          <idno type="call">ERC-2016-COG</idno>
          <orgName>SYSTEMATICGRAPH</orgName>
          <desc>Systematic mapping of the complexity landscape of hard algorithmic graph problems</desc>
          <date type="start">2017-07-01</date>
          <date type="end">2022-12-31</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>