<?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-00353904</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-01T21:13:45+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Complete and Incomplete Algorithms for the Queen Graph Coloring Problem</title>
            <author role="aut">
              <persName>
                <forename type="first">Michel</forename>
                <surname>Vasquez</surname>
              </persName>
              <email type="md5">0cd3da561ff0835367c7d4f0d9e9b13d</email>
              <email type="domain">mines-ales.fr</email>
              <idno type="idhal" notation="string">michel-vasquez</idno>
              <idno type="idhal" notation="numeric">170166</idno>
              <idno type="halauthorid" notation="string">419-170166</idno>
              <idno type="IDREF">https://www.idref.fr/092789528</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-6346-2550</idno>
              <affiliation ref="#struct-214"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Djamal</forename>
                <surname>Habet</surname>
              </persName>
              <email type="md5">67dd7664827dd6e2063d1204d3f23cb8</email>
              <email type="domain">lsis.org</email>
              <idno type="idhal" notation="numeric">840358</idno>
              <idno type="halauthorid" notation="string">105655-840358</idno>
              <affiliation ref="#struct-199402"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Michel</forename>
                <surname>Vasquez</surname>
              </persName>
              <email type="md5">0cd3da561ff0835367c7d4f0d9e9b13d</email>
              <email type="domain">mines-ales.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2023-10-24 14:14:55</date>
              <date type="whenModified">2026-02-12 08:38:01</date>
              <date type="whenReleased">2023-10-25 07:46:47</date>
              <date type="whenProduced">2004-08-22</date>
              <date type="whenEndEmbargoed">2023-10-24</date>
              <ref type="file" target="https://hal.science/hal-00353904v1/document">
                <date notBefore="2023-10-24"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-00353904v1/file/complete-and-incomplete-algorithms.pdf" id="file-4256193-3714243">
                <date notBefore="2023-10-24"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="182760">
                <persName>
                  <forename>Michel</forename>
                  <surname>Vasquez</surname>
                </persName>
                <email type="md5">0cd3da561ff0835367c7d4f0d9e9b13d</email>
                <email type="domain">mines-ales.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-00353904</idno>
            <idno type="halUri">https://hal.science/hal-00353904</idno>
            <idno type="halBibtex">vasquez:hal-00353904</idno>
            <idno type="halRefHtml">&lt;i&gt;ECAI 2004: 16th European Conference on Artificial Intelligence&lt;/i&gt;, Aug 2004, Valencia, Spain. pp.226-230</idno>
            <idno type="halRef">ECAI 2004: 16th European Conference on Artificial Intelligence, Aug 2004, Valencia, Spain. pp.226-230</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-4256193-3714243"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNIV-TLN">Université de Toulon</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="UNIV-AMU">Aix Marseille Université</idno>
            <idno type="stamp" n="EM-ALES">Ecole des Mines d'Alès</idno>
            <idno type="stamp" n="LSIS">Laboratoire des Sciences de l'Information et des Systèmes</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="LIS-LAB">Laboratoire d'Informatique et Systèmes</idno>
            <idno type="stamp" n="INSTITUTS-TELECOM">composantes instituts telecom </idno>
            <idno type="stamp" n="IMT-MINES-ALES" corresp="INSTITUT-MINES-TELECOM">IMT Mines Alès</idno>
            <idno type="stamp" n="INSTITUT-MINES-TELECOM">Institut Mines Telecom</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">Complete and Incomplete Algorithms for the Queen Graph Coloring Problem</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Michel</forename>
                    <surname>Vasquez</surname>
                  </persName>
                  <email type="md5">0cd3da561ff0835367c7d4f0d9e9b13d</email>
                  <email type="domain">mines-ales.fr</email>
                  <idno type="idhal" notation="string">michel-vasquez</idno>
                  <idno type="idhal" notation="numeric">170166</idno>
                  <idno type="halauthorid" notation="string">419-170166</idno>
                  <idno type="IDREF">https://www.idref.fr/092789528</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-6346-2550</idno>
                  <affiliation ref="#struct-214"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Djamal</forename>
                    <surname>Habet</surname>
                  </persName>
                  <email type="md5">67dd7664827dd6e2063d1204d3f23cb8</email>
                  <email type="domain">lsis.org</email>
                  <idno type="idhal" notation="numeric">840358</idno>
                  <idno type="halauthorid" notation="string">105655-840358</idno>
                  <affiliation ref="#struct-199402"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Proceedings of the 16th Eureopean Conference on Artificial Intelligence, ECAI'2004</title>
                <meeting>
                  <title>ECAI 2004: 16th European Conference on Artificial Intelligence</title>
                  <date type="start">2004-08-22</date>
                  <settlement>Valencia</settlement>
                  <country key="ES">Spain</country>
                </meeting>
                <imprint>
                  <publisher>IOS Press</publisher>
                  <biblScope unit="pp">226-230</biblScope>
                  <date type="datePub">2004-08-22</date>
                </imprint>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Symetry</term>
                <term xml:lang="en">Queen Graph</term>
                <term xml:lang="en">Graph Coloring</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-ro">Computer Science [cs]/Operations Research [math.OC]</classCode>
              <classCode scheme="halDomain" n="info.info-ai">Computer Science [cs]/Artificial Intelligence [cs.AI]</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>The queen graph coloring problem consists in covering a n x n chess board with n^2 queens in such a manner that two queens of the same color cannot attack each other. When the size, $n$, of the chess board is not a multiple of 2 or 3 it is difficult to color the queen graph with only n colors. We have developed an exact algorithm which is able to solve exhaustively this problem for dimension up to n=12 and finds a solution for n=14 in one week computing time. The 454 solutions of queen-12 show horizontal and vertical symmetries. Starting from this observation we design a new exact, but incomplete, algorithm which leads us to color queen-n problems with n colors for n=15,16,18,20,21,24 and 28 in less than one day computing time. In this paper we recall briefly the main characteristics of the first search tree algorithm then we describe the four kinds of geometric operations we have used to improve significantly our results.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-214" status="OLD">
          <idno type="IdRef">071473114</idno>
          <idno type="ISNI">0000 0004 0372 9024</idno>
          <idno type="RNSR">199420609G</idno>
          <orgName>Laboratoire de Génie Informatique et Ingénierie de Production</orgName>
          <orgName type="acronym">LGI2P</orgName>
          <date type="start">1994-01-01</date>
          <date type="end">2019-12-31</date>
          <desc>
            <address>
              <addrLine>Ecole des Mines d'Alès-Laboratoire de Génie Informatique et d'Ingénierie de ProductionSite de Croupillac7 rue Jules RenardAlès - 30319 CedexFrance</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lgi2p.ema.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-6279" type="direct"/>
            <relation active="#struct-302102" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-199402" status="OLD">
          <idno type="IdRef">150137125</idno>
          <idno type="RNSR">201220329Z</idno>
          <orgName>Laboratoire des Sciences de l'Information et des Systèmes</orgName>
          <orgName type="acronym">LSIS</orgName>
          <date type="start">2012-01-01</date>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>Domaine Universitaire de Saint-JérômeBatiment PolytechAvenue Escadrille Normandie-Niemen13397 MARSEILLE CEDEX 20</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lsis.org</ref>
          </desc>
          <listRelation>
            <relation name="UMR7296" active="#struct-198056" type="direct"/>
            <relation name="UMR7296" active="#struct-303091" type="direct"/>
            <relation name="UMR7296" active="#struct-303092" type="direct"/>
            <relation name="UMR7296" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-6279" status="VALID">
          <idno type="IdRef">032486111</idno>
          <idno type="ISNI">0000 0000 9734 247X</idno>
          <idno type="ROR">https://ror.org/03e8rf594</idno>
          <orgName>IMT MINES ALÈS</orgName>
          <date type="start">1843-09-22</date>
          <desc>
            <address>
              <addrLine>IMT - Mines Ales École des MinesSite de Clavières : 6 avenue de Clavières, 30319 Alès CedexSite de Croupillac : Rue Jules Renard, 30100 AlèsSite de Pau : Hélioparc (bâtiment Einstein 1), 2 avenue du Président-Pierre-Angot, 64053 Pau Cedex 9</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.mines-ales.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-302102" 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-198056" status="VALID">
          <idno type="IdRef">15863621X</idno>
          <idno type="ISNI">0000 0001 2176 4817</idno>
          <idno type="ROR">https://ror.org/035xkbk20</idno>
          <orgName>Aix Marseille Université</orgName>
          <orgName type="acronym">AMU</orgName>
          <date type="start">2012-01-01</date>
          <desc>
            <address>
              <addrLine>Aix-Marseille UniversitéJardins du Pharo58 Boulevard Charles Livon13284 Marseille cedex 7</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-amu.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-303091" status="VALID">
          <idno type="IdRef">031122337</idno>
          <idno type="ROR">https://ror.org/02m9kbe37</idno>
          <orgName>Université de Toulon</orgName>
          <orgName type="acronym">UTLN</orgName>
          <desc>
            <address>
              <addrLine>Avenue de l'Université - BP 20132 - 83957 La Garde Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-tln.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-303092" status="OLD">
          <orgName>Arts et Métiers Paristech ENSAM Aix-en-Provence</orgName>
          <date type="end">2020-03-04</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </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>