The complexity of detecting crossingfree configurations in the plane
Identifieur interne : 002C06 ( Main/Exploration ); précédent : 002C05; suivant : 002C07The complexity of detecting crossingfree configurations in the plane
Auteurs : Klaus Jansen [Allemagne, Autriche] ; Gerhard J. Woeginger [Allemagne, Autriche]Source :
- BIT Numerical Mathematics [ 0006-3835 ] ; 1993-12-01.
Abstract
Abstract: The computational complexity of the following type of problem is studied. Given a geometric graphG=(P, S) whereP is a set of points in the Euclidean plane andS a set of straight (closed) line segments between pairs of points inP, we want to know whetherG possesses a crossingfree subgraph of a special type. We analyze the problem of detecting crossingfree spanning trees, one factors and two factors in the plane. We also consider special restrictions on the slopes and on the lengths of the edges in the subgraphs.
Url:
DOI: 10.1007/BF01990536
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001143
- to stream Istex, to step Curation: 001032
- to stream Istex, to step Checkpoint: 001310
- to stream Main, to step Merge: 003157
- to stream Main, to step Curation: 002C06
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">The complexity of detecting crossingfree configurations in the plane</title><author><name sortKey="Jansen, Klaus" sort="Jansen, Klaus" uniqKey="Jansen K" first="Klaus" last="Jansen">Klaus Jansen</name></author><author><name sortKey="Woeginger, Gerhard J" sort="Woeginger, Gerhard J" uniqKey="Woeginger G" first="Gerhard J." last="Woeginger">Gerhard J. Woeginger</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:6597678048C75955853DD52F707557F26EC2DF5D</idno><date when="1993" year="1993">1993</date><idno type="doi">10.1007/BF01990536</idno><idno type="url">https://api.istex.fr/document/6597678048C75955853DD52F707557F26EC2DF5D/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001143</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001143</idno><idno type="wicri:Area/Istex/Curation">001032</idno><idno type="wicri:Area/Istex/Checkpoint">001310</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001310</idno><idno type="wicri:doubleKey">0006-3835:1993:Jansen K:the:complexity:of</idno><idno type="wicri:Area/Main/Merge">003157</idno><idno type="wicri:Area/Main/Curation">002C06</idno><idno type="wicri:Area/Main/Exploration">002C06</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">The complexity of detecting crossingfree configurations in the plane</title><author><name sortKey="Jansen, Klaus" sort="Jansen, Klaus" uniqKey="Jansen K" first="Klaus" last="Jansen">Klaus Jansen</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Fachbereich IV, Mathematik und Informatik, Universität Trier, Postfach 3825, W-5500, Trier</wicri:regionArea><wicri:noRegion>Trier</wicri:noRegion><wicri:noRegion>Trier</wicri:noRegion></affiliation><affiliation wicri:level="1"><country xml:lang="fr">Autriche</country><wicri:regionArea>Institut für Informationsverarbeitung, Technische Universität Graz, Klosterwiesgasse 32/II, A-8010, Graz</wicri:regionArea><wicri:noRegion>Graz</wicri:noRegion></affiliation></author><author><name sortKey="Woeginger, Gerhard J" sort="Woeginger, Gerhard J" uniqKey="Woeginger G" first="Gerhard J." last="Woeginger">Gerhard J. Woeginger</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Fachbereich IV, Mathematik und Informatik, Universität Trier, Postfach 3825, W-5500, Trier</wicri:regionArea><wicri:noRegion>Trier</wicri:noRegion><wicri:noRegion>Trier</wicri:noRegion></affiliation><affiliation wicri:level="1"><country xml:lang="fr">Autriche</country><wicri:regionArea>Institut für Informationsverarbeitung, Technische Universität Graz, Klosterwiesgasse 32/II, A-8010, Graz</wicri:regionArea><wicri:noRegion>Graz</wicri:noRegion></affiliation></author></analytic><monogr></monogr><series><title level="j">BIT Numerical Mathematics</title><title level="j" type="abbrev">BIT</title><idno type="ISSN">0006-3835</idno><idno type="eISSN">1572-9125</idno><imprint><publisher>Kluwer Academic Publishers</publisher><pubPlace>Dordrecht</pubPlace><date type="published" when="1993-12-01">1993-12-01</date><biblScope unit="volume">33</biblScope><biblScope unit="issue">4</biblScope><biblScope unit="page" from="580">580</biblScope><biblScope unit="page" to="595">595</biblScope></imprint><idno type="ISSN">0006-3835</idno></series><idno type="istex">6597678048C75955853DD52F707557F26EC2DF5D</idno><idno type="DOI">10.1007/BF01990536</idno><idno type="ArticleID">BF01990536</idno><idno type="ArticleID">Art4</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0006-3835</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: The computational complexity of the following type of problem is studied. Given a geometric graphG=(P, S) whereP is a set of points in the Euclidean plane andS a set of straight (closed) line segments between pairs of points inP, we want to know whetherG possesses a crossingfree subgraph of a special type. We analyze the problem of detecting crossingfree spanning trees, one factors and two factors in the plane. We also consider special restrictions on the slopes and on the lengths of the edges in the subgraphs.</div></front></TEI><affiliations><list><country><li>Allemagne</li><li>Autriche</li></country></list><tree><country name="Allemagne"><noRegion><name sortKey="Jansen, Klaus" sort="Jansen, Klaus" uniqKey="Jansen K" first="Klaus" last="Jansen">Klaus Jansen</name></noRegion><name sortKey="Woeginger, Gerhard J" sort="Woeginger, Gerhard J" uniqKey="Woeginger G" first="Gerhard J." last="Woeginger">Gerhard J. Woeginger</name></country><country name="Autriche"><noRegion><name sortKey="Jansen, Klaus" sort="Jansen, Klaus" uniqKey="Jansen K" first="Klaus" last="Jansen">Klaus Jansen</name></noRegion><name sortKey="Woeginger, Gerhard J" sort="Woeginger, Gerhard J" uniqKey="Woeginger G" first="Gerhard J." last="Woeginger">Gerhard J. Woeginger</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002C06 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 002C06 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:6597678048C75955853DD52F707557F26EC2DF5D
|texte= The complexity of detecting crossingfree configurations in the plane
}}
| This area was generated with Dilib version V0.6.31. |  |