<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
    <record>
        <controlfield tag="001">78101</controlfield>
        <controlfield tag="005">20191122145055.0</controlfield>
        <datafield tag="024" ind1="7" ind2=" ">
            <subfield code="2">doi</subfield>
            <subfield code="a">10.1016/j.comgeo.2017.05.009</subfield>
        </datafield>
        <datafield tag="024" ind1="8" ind2=" ">
            <subfield code="2">sideral</subfield>
            <subfield code="a">101839</subfield>
        </datafield>
        <datafield tag="037" ind1=" " ind2=" ">
            <subfield code="a">ART-2018-101839</subfield>
        </datafield>
        <datafield tag="041" ind1=" " ind2=" ">
            <subfield code="a">eng</subfield>
        </datafield>
        <datafield tag="100" ind1=" " ind2=" ">
            <subfield code="a">Claverol, Mercè</subfield>
        </datafield>
        <datafield tag="245" ind1=" " ind2=" ">
            <subfield code="a">On Hamiltonian alternating cycles and paths</subfield>
        </datafield>
        <datafield tag="260" ind1=" " ind2=" ">
            <subfield code="c">2018</subfield>
        </datafield>
        <datafield tag="506" ind1="0" ind2=" ">
            <subfield code="a">Access copy available to the general public</subfield>
            <subfield code="f">Unrestricted</subfield>
        </datafield>
        <datafield tag="520" ind1="3" ind2=" ">
            <subfield code="a">We undertake a study on computing Hamiltonian alternating cycles and paths on bicolored point sets. This has been an intensively studied problem, not always with a solution, when the paths and cycles are also required to be plane. In this paper, we relax the constraint on the cycles and paths from being plane to being 1-plane, and deal with the same type of questions as those for the plane case, obtaining a remarkable variety of results. For point sets in general position, our main result is that it is always possible to obtain a 1-plane Hamiltonian alternating cycle. When the point set is in convex position, we prove that every Hamiltonian alternating cycle with minimum number of crossings is 1-plane, and provide O(n) and O(n2) time algorithms for computing, respectively, Hamiltonian alternating cycles and paths with minimum number of crossings.</subfield>
        </datafield>
        <datafield tag="536" ind1=" " ind2=" ">
            <subfield code="9">info:eu-repo/grantAgreement/ES/DGA/E58</subfield>
            <subfield code="9">info:eu-repo/grantAgreement/ES/MINECO-FEDER/MTM2014-60127-P</subfield>
            <subfield code="9">info:eu-repo/grantAgreement/ES/MINECO-FEDER/MTM2015-63791-R</subfield>
        </datafield>
        <datafield tag="540" ind1=" " ind2=" ">
            <subfield code="9">info:eu-repo/semantics/openAccess</subfield>
            <subfield code="a">by-nc-nd</subfield>
            <subfield code="u">http://creativecommons.org/licenses/by-nc-nd/3.0/es/</subfield>
        </datafield>
        <datafield tag="590" ind1=" " ind2=" ">
            <subfield code="a">0.343</subfield>
            <subfield code="b">2018</subfield>
        </datafield>
        <datafield tag="591" ind1=" " ind2=" ">
            <subfield code="a">MATHEMATICS, APPLIED</subfield>
            <subfield code="b">248 / 254 = 0.976</subfield>
            <subfield code="c">2018</subfield>
            <subfield code="d">Q4</subfield>
            <subfield code="e">T3</subfield>
        </datafield>
        <datafield tag="591" ind1=" " ind2=" ">
            <subfield code="a">MATHEMATICS</subfield>
            <subfield code="b">293 / 313 = 0.936</subfield>
            <subfield code="c">2018</subfield>
            <subfield code="d">Q4</subfield>
            <subfield code="e">T3</subfield>
        </datafield>
        <datafield tag="592" ind1=" " ind2=" ">
            <subfield code="a">0.492</subfield>
            <subfield code="b">2018</subfield>
        </datafield>
        <datafield tag="593" ind1=" " ind2=" ">
            <subfield code="a">Computational Mathematics</subfield>
            <subfield code="c">2018</subfield>
            <subfield code="d">Q2</subfield>
        </datafield>
        <datafield tag="593" ind1=" " ind2=" ">
            <subfield code="a">Computational Theory and Mathematics</subfield>
            <subfield code="c">2018</subfield>
            <subfield code="d">Q2</subfield>
        </datafield>
        <datafield tag="593" ind1=" " ind2=" ">
            <subfield code="a">Geometry and Topology</subfield>
            <subfield code="c">2018</subfield>
            <subfield code="d">Q2</subfield>
        </datafield>
        <datafield tag="593" ind1=" " ind2=" ">
            <subfield code="a">Control and Optimization</subfield>
            <subfield code="c">2018</subfield>
            <subfield code="d">Q2</subfield>
        </datafield>
        <datafield tag="593" ind1=" " ind2=" ">
            <subfield code="a">Computer Science Applications</subfield>
            <subfield code="c">2018</subfield>
            <subfield code="d">Q2</subfield>
        </datafield>
        <datafield tag="655" ind1=" " ind2="4">
            <subfield code="a">info:eu-repo/semantics/article</subfield>
            <subfield code="v">info:eu-repo/semantics/acceptedVersion</subfield>
        </datafield>
        <datafield tag="700" ind1=" " ind2=" ">
            <subfield code="0">(orcid)0000-0002-6519-1472</subfield>
            <subfield code="a">García, Alfredo</subfield>
            <subfield code="u">Universidad de Zaragoza</subfield>
        </datafield>
        <datafield tag="700" ind1=" " ind2=" ">
            <subfield code="a">Garijo, Delia</subfield>
        </datafield>
        <datafield tag="700" ind1=" " ind2=" ">
            <subfield code="a">Seara, Carlos</subfield>
        </datafield>
        <datafield tag="700" ind1=" " ind2=" ">
            <subfield code="0">(orcid)0000-0002-9543-7170</subfield>
            <subfield code="a">Tejel, Javier</subfield>
            <subfield code="u">Universidad de Zaragoza</subfield>
        </datafield>
        <datafield tag="710" ind1="2" ind2=" ">
            <subfield code="1">2007</subfield>
            <subfield code="2">265</subfield>
            <subfield code="a">Universidad de Zaragoza</subfield>
            <subfield code="b">Dpto. Métodos Estadísticos</subfield>
            <subfield code="c">Área Estadís. Investig. Opera.</subfield>
        </datafield>
        <datafield tag="773" ind1=" " ind2=" ">
            <subfield code="g">68 (2018), 146-166</subfield>
            <subfield code="p">Comput. geom.</subfield>
            <subfield code="t">COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS</subfield>
            <subfield code="x">0925-7721</subfield>
        </datafield>
        <datafield tag="856" ind1="4" ind2=" ">
            <subfield code="s">509412</subfield>
            <subfield code="u">http://zaguan.unizar.es/record/78101/files/texto_completo.pdf</subfield>
            <subfield code="y">Postprint</subfield>
        </datafield>
        <datafield tag="856" ind1="4" ind2=" ">
            <subfield code="s">83949</subfield>
            <subfield code="u">http://zaguan.unizar.es/record/78101/files/texto_completo.jpg?subformat=icon</subfield>
            <subfield code="x">icon</subfield>
            <subfield code="y">Postprint</subfield>
        </datafield>
        <datafield tag="909" ind1="C" ind2="O">
            <subfield code="o">oai:zaguan.unizar.es:78101</subfield>
            <subfield code="p">articulos</subfield>
            <subfield code="p">driver</subfield>
        </datafield>
        <datafield tag="951" ind1=" " ind2=" ">
            <subfield code="a">2019-11-22-14:45:27</subfield>
        </datafield>
        <datafield tag="980" ind1=" " ind2=" ">
            <subfield code="a">ARTICLE</subfield>
        </datafield>
    </record>

    
</collection>