Publikation:

Universal Pointsets for 2-Coloured Trees

Vorschaubild

Dateien

Zu diesem Dokument gibt es keine Dateien.

Datum

2011

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.1007/978-3-642-18469-7_33
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
Beitrag zu einem Konferenzband
Publikationsstatus
Published

Erschienen in

BRANDES, Ulrik, ed., Sabine CORNELSEN, ed.. Graph Drawing : 18th International Symposium, GD 2010, Konstanz, Germany, September 21-24, 2010, revised selected papers. Berlin: Springer, 2011, pp. 365-370. Lecture Notes in Computer Science. 6502. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-642-18468-0. Available under: doi: 10.1007/978-3-642-18469-7_33

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 pointset 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 pointsets 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

Planar Graph, Distinct Point, Blue Point, Convex Region, Outerplanar Graph

Konferenz

18th International Symposium, GD 2010, 21. Sept. 2010 - 24. Sept. 2010, Konstanz, Germany
Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690VAN GARDEREN, Mereke, Giuseppe LIOTTA, Henk MEIJER, 2011. Universal Pointsets for 2-Coloured Trees. 18th International Symposium, GD 2010. Konstanz, Germany, 21. Sept. 2010 - 24. Sept. 2010. In: BRANDES, Ulrik, ed., Sabine CORNELSEN, ed.. Graph Drawing : 18th International Symposium, GD 2010, Konstanz, Germany, September 21-24, 2010, revised selected papers. Berlin: Springer, 2011, pp. 365-370. Lecture Notes in Computer Science. 6502. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-642-18468-0. Available under: doi: 10.1007/978-3-642-18469-7_33
BibTex
@inproceedings{vanGarderen2011Unive-44697,
  year={2011},
  doi={10.1007/978-3-642-18469-7_33},
  title={Universal Pointsets for 2-Coloured Trees},
  number={6502},
  isbn={978-3-642-18468-0},
  issn={0302-9743},
  publisher={Springer},
  address={Berlin},
  series={Lecture Notes in Computer Science},
  booktitle={Graph Drawing : 18th International Symposium, GD 2010, Konstanz, Germany, September 21-24, 2010, revised selected papers},
  pages={365--370},
  editor={Brandes, Ulrik and Cornelsen, Sabine},
  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/44697">
    <dc:contributor>van Garderen, Mereke</dc:contributor>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-01-23T13:48:20Z</dc:date>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-01-23T13:48:20Z</dcterms:available>
    <dc:creator>Liotta, Giuseppe</dc:creator>
    <dc:creator>van Garderen, Mereke</dc:creator>
    <dcterms:title>Universal Pointsets for 2-Coloured Trees</dcterms:title>
    <dc:language>eng</dc:language>
    <dc:contributor>Liotta, Giuseppe</dc:contributor>
    <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 pointset 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 pointsets for meaningful classes of 2-coloured trees and show applications of these results to the coloured simultaneous geometric embeddability Problem.</dcterms:abstract>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:contributor>Meijer, Henk</dc:contributor>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/44697"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:issued>2011</dcterms:issued>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Meijer, Henk</dc:creator>
  </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
Ja
Begutachtet
Diese Publikation teilen