Universal Pointsets for 2-Coloured Trees
| dc.contributor.author | van Garderen, Mereke | |
| dc.contributor.author | Liotta, Giuseppe | |
| dc.contributor.author | Meijer, Henk | |
| dc.date.accessioned | 2019-01-23T13:48:20Z | |
| dc.date.available | 2019-01-23T13:48:20Z | |
| dc.date.issued | 2011 | eng |
| dc.description.abstract | 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. | eng |
| dc.description.version | published | eng |
| dc.identifier.doi | 10.1007/978-3-642-18469-7_33 | eng |
| dc.identifier.uri | https://kops.uni-konstanz.de/handle/123456789/44697 | |
| dc.language.iso | eng | eng |
| dc.subject | Planar Graph, Distinct Point, Blue Point, Convex Region, Outerplanar Graph | eng |
| dc.subject.ddc | 004 | eng |
| dc.title | Universal Pointsets for 2-Coloured Trees | eng |
| dc.type | INPROCEEDINGS | eng |
| dspace.entity.type | Publication | |
| kops.citation.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}
} | |
| kops.citation.iso690 | VAN 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 | deu |
| kops.citation.iso690 | VAN GARDEREN, Mereke, Giuseppe LIOTTA, Henk MEIJER, 2011. Universal Pointsets for 2-Coloured Trees. 18th International Symposium, GD 2010. Konstanz, Germany, Sep 21, 2010 - Sep 24, 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 | eng |
| kops.citation.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> | |
| kops.conferencefield | 18th International Symposium, GD 2010, 21. Sept. 2010 - 24. Sept. 2010, Konstanz, Germany | deu |
| kops.date.conferenceEnd | 2010-09-24 | eng |
| kops.date.conferenceStart | 2010-09-21 | eng |
| kops.flag.knbibliography | true | |
| kops.location.conference | Konstanz, Germany | eng |
| kops.sourcefield | BRANDES, Ulrik, ed., Sabine CORNELSEN, ed.. <i>Graph Drawing : 18th International Symposium, GD 2010, Konstanz, Germany, September 21-24, 2010, revised selected papers</i>. 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 | deu |
| kops.sourcefield.plain | 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 | deu |
| kops.sourcefield.plain | 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 | eng |
| kops.title.conference | 18th International Symposium, GD 2010 | eng |
| relation.isAuthorOfPublication | 9890be71-7f0c-4135-8875-84fa5b6d200b | |
| relation.isAuthorOfPublication.latestForDiscovery | 9890be71-7f0c-4135-8875-84fa5b6d200b | |
| source.bibliographicInfo.fromPage | 365 | eng |
| source.bibliographicInfo.seriesNumber | 6502 | eng |
| source.bibliographicInfo.toPage | 370 | eng |
| source.contributor.editor | Brandes, Ulrik | |
| source.contributor.editor | Cornelsen, Sabine | |
| source.identifier.eissn | 1611-3349 | eng |
| source.identifier.isbn | 978-3-642-18468-0 | eng |
| source.identifier.issn | 0302-9743 | eng |
| source.publisher | Springer | eng |
| source.publisher.location | Berlin | eng |
| source.relation.ispartofseries | Lecture Notes in Computer Science | eng |
| source.title | Graph Drawing : 18th International Symposium, GD 2010, Konstanz, Germany, September 21-24, 2010, revised selected papers | eng |