<?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-00958903</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-18T01:35:42+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">NP-Completeness Results for Minimum Planar Spanners</title>
            <author role="aut">
              <persName>
                <forename type="first">Ulrik</forename>
                <surname>Brandes</surname>
              </persName>
              <idno type="halauthorid">510450-0</idno>
              <affiliation ref="#struct-246316"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Dagmar</forename>
                <surname>Handke</surname>
              </persName>
              <idno type="halauthorid">809316-0</idno>
              <affiliation ref="#struct-246316"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Service Ist</forename>
                <surname>Inria Sophia Antipolis-Méditerranée / I3s</surname>
              </persName>
              <email type="md5">7c88c2dda46d455591481b4e07aef779</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2014-03-13 15:52:08</date>
              <date type="whenModified">2023-02-07 03:42:37</date>
              <date type="whenReleased">2014-03-13 16:07:04</date>
              <date type="whenProduced">1998-01-01</date>
              <date type="whenEndEmbargoed">2014-03-13</date>
              <ref type="file" target="https://inria.hal.science/hal-00958903v1/document">
                <date notBefore="2014-03-13"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-00958903v1/file/dm030101.pdf" id="file-958903-572328">
                <date notBefore="2014-03-13"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="129574">
                <persName>
                  <forename>Service Ist</forename>
                  <surname>Inria Sophia Antipolis-Méditerranée / I3s</surname>
                </persName>
                <email type="md5">7c88c2dda46d455591481b4e07aef779</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-00958903</idno>
            <idno type="halUri">https://inria.hal.science/hal-00958903</idno>
            <idno type="halBibtex">brandes:hal-00958903</idno>
            <idno type="halRefHtml">&lt;i&gt;Discrete Mathematics and Theoretical Computer Science&lt;/i&gt;, 1998, Vol. 3 no. 1 (1), pp.1-10. &lt;a target="_blank" href="https://dx.doi.org/10.46298/dmtcs.257"&gt;&amp;#x27E8;10.46298/dmtcs.257&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Discrete Mathematics and Theoretical Computer Science, 1998, Vol. 3 no. 1 (1), pp.1-10. &amp;#x27E8;10.46298/dmtcs.257&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-958903-572328"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="DMTCS">DMTCS</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>
          </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">NP-Completeness Results for Minimum Planar Spanners</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Ulrik</forename>
                    <surname>Brandes</surname>
                  </persName>
                  <idno type="halauthorid">510450-0</idno>
                  <affiliation ref="#struct-246316"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Dagmar</forename>
                    <surname>Handke</surname>
                  </persName>
                  <idno type="halauthorid">809316-0</idno>
                  <affiliation ref="#struct-246316"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">649</idno>
                <idno type="issn">1462-7264</idno>
                <idno type="eissn">1365-8050</idno>
                <title level="j">Discrete Mathematics and Theoretical Computer Science</title>
                <imprint>
                  <publisher>DMTCS</publisher>
                  <biblScope unit="volume">Vol. 3 no. 1</biblScope>
                  <biblScope unit="issue">1</biblScope>
                  <biblScope unit="pp">1-10</biblScope>
                  <date type="datePub">1998-01-01</date>
                </imprint>
              </monogr>
              <idno type="doi">10.46298/dmtcs.257</idno>
              <ref target="http://www.dmtcs.org/volumes/abstracts/dm030101.abs.html" type="seeAlso"/>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="fr">graph spanners</term>
                <term xml:lang="fr">NP-completeness</term>
                <term xml:lang="fr">planar graphs</term>
              </keywords>
              <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>For any fixed parameter t greater or equal to 1, a \emph t-spanner of a graph G is a spanning subgraph in which the distance between every pair of vertices is at most t times their distance in G. A \emph minimum t-spanner is a t-spanner with minimum total edge weight or, in unweighted graphs, minimum number of edges. In this paper, we prove the NP-hardness of finding minimum t-spanners for planar weighted graphs and digraphs if t greater or equal to 3, and for planar unweighted graphs and digraphs if t greater or equal to 5. We thus extend results on that problem to the interesting case where the instances are known to be planar. We also introduce the related problem of finding minimum \emphplanar t-spanners and establish its NP-hardness for similar fixed values of t.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-246316" status="VALID">
          <orgName>Faculty of Mathematics and Computer Science [Konstanz]</orgName>
          <desc>
            <address>
              <addrLine>University of Konstanz D-78457 Konstanz</addrLine>
              <country key="DE"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-300986" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300986" status="VALID">
          <idno type="ROR">https://ror.org/0546hnb39</idno>
          <orgName>University of Konstanz</orgName>
          <desc>
            <address>
              <addrLine>78457 Konstanz</addrLine>
              <country key="DE"/>
            </address>
            <ref type="url">https://www.uni-konstanz.de</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>