Publikation:

Universal point sets for 2-coloured trees

Vorschaubild

Dateien

Zu diesem Dokument gibt es keine Dateien.

Datum

2012

Autor:innen

Liotta, Giuseppe
Meijer, Henk

Herausgeber:innen

Kontakt

ISSN der Zeitschrift

Electronic ISSN

ISBN

Bibliografische Daten

Verlag

Schriftenreihe

Auflagebezeichnung

URI (zitierfähiger Link)
DOI (zitierfähiger Link)
https://doi.org/10.1016/j.ipl.2012.01.009
ArXiv-ID

Internationale Patentnummer

Angaben zur Forschungsförderung

Projekt

Open Access-Veröffentlichung

Sammlungen

Informatik und Informationswissenschaft: Publikationen
Core Facility der Universität Konstanz

Gesperrt bis

Titel in einer weiteren Sprache

Publikationstyp
Zeitschriftenartikel
Publikationsstatus
Published

Erschienen in

Information Processing Letters. 2012, 112(8-9), pp. 346-350. ISSN 0020-0190. eISSN 1872-6119. Available under: doi: 10.1016/j.ipl.2012.01.009

Zusammenfassung

Let R and B be two sets of distinct points such that the points of R are coloured red and the points of B are coloured blue. Let G be a family of planar graphs such that for each graph in the family |R| vertices are red and |B| vertices are blue. The set R ∪ B is a universal point set for G if every graph G ∈ G has a straight-line planar drawing such that the blue vertices of G are mapped to the points of B and the red vertices of G are mapped to the points of R. In this paper we describe universal point sets for meaningful classes of 2-coloured trees and show applications of these results to the coloured simultaneous geometric embeddability problem

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
004 Informatik

Schlagwörter

Graph drawing; Universal point sets; Coloured simultaneous embeddability; Computational geometry

Konferenz

Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690VAN GARDEREN, Mereke, Giuseppe LIOTTA, Henk MEIJER, 2012. Universal point sets for 2-coloured trees. In: Information Processing Letters. 2012, 112(8-9), pp. 346-350. ISSN 0020-0190. eISSN 1872-6119. Available under: doi: 10.1016/j.ipl.2012.01.009
BibTex
@article{vanGarderen2012-04Unive-44692,
  year={2012},
  doi={10.1016/j.ipl.2012.01.009},
  title={Universal point sets for 2-coloured trees},
  number={8-9},
  volume={112},
  issn={0020-0190},
  journal={Information Processing Letters},
  pages={346--350},
  author={van Garderen, Mereke and Liotta, Giuseppe and Meijer, Henk}
}
RDF
<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/44692">
    <dc:contributor>van Garderen, Mereke</dc:contributor>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Meijer, Henk</dc:contributor>
    <dcterms:issued>2012-04</dcterms:issued>
    <dc:creator>van Garderen, Mereke</dc:creator>
    <dc:language>eng</dc:language>
    <dc:creator>Liotta, Giuseppe</dc:creator>
    <dc:contributor>Liotta, Giuseppe</dc:contributor>
    <dc:creator>Meijer, Henk</dc:creator>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:title>Universal point sets for 2-coloured trees</dcterms:title>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/44692"/>
    <dcterms:abstract xml:lang="eng">Let R and B be two sets of distinct points such that the points of R are coloured red and the points of B are coloured blue. Let G be a family of planar graphs such that for each graph in the family |R| vertices are red and |B| vertices are blue. The set R ∪ B is a universal point set for G if every graph G ∈ G has a straight-line planar drawing such that the blue vertices of G are mapped to the points of B and the red vertices of G are mapped to the points of R. In this paper we describe universal point sets for meaningful classes of 2-coloured trees and show applications of these results to the coloured simultaneous geometric embeddability problem</dcterms:abstract>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-01-23T13:32:09Z</dc:date>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-01-23T13:32:09Z</dcterms:available>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
  </rdf:Description>
</rdf:RDF>

Interner Vermerk

xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter

Kontakt
URL der Originalveröffentl.

Prüfdatum der URL

Prüfungsdatum der Dissertation

Finanzierungsart

Kommentar zur Publikation

Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Begutachtet
Unbekannt
Diese Publikation teilen