Universal point sets 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:32:09Z | |
| dc.date.available | 2019-01-23T13:32:09Z | |
| dc.date.issued | 2012-04 | 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 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 | eng |
| dc.description.version | published | eng |
| dc.identifier.doi | 10.1016/j.ipl.2012.01.009 | eng |
| dc.identifier.uri | https://kops.uni-konstanz.de/handle/123456789/44692 | |
| dc.language.iso | eng | eng |
| dc.subject | Graph drawing; Universal point sets; Coloured simultaneous embeddability; Computational geometry | eng |
| dc.subject.ddc | 004 | eng |
| dc.title | Universal point sets for 2-coloured trees | eng |
| dc.type | JOURNAL_ARTICLE | eng |
| dspace.entity.type | Publication | |
| kops.citation.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}
} | |
| kops.citation.iso690 | VAN 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 | deu |
| kops.citation.iso690 | VAN 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 | 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/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> | |
| kops.flag.isPeerReviewed | unknown | eng |
| kops.sourcefield | Information Processing Letters. 2012, <b>112</b>(8-9), pp. 346-350. ISSN 0020-0190. eISSN 1872-6119. Available under: doi: 10.1016/j.ipl.2012.01.009 | deu |
| kops.sourcefield.plain | 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 | deu |
| kops.sourcefield.plain | 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 | eng |
| relation.isAuthorOfPublication | 9890be71-7f0c-4135-8875-84fa5b6d200b | |
| relation.isAuthorOfPublication.latestForDiscovery | 9890be71-7f0c-4135-8875-84fa5b6d200b | |
| source.bibliographicInfo.fromPage | 346 | eng |
| source.bibliographicInfo.issue | 8-9 | eng |
| source.bibliographicInfo.toPage | 350 | eng |
| source.bibliographicInfo.volume | 112 | eng |
| source.identifier.eissn | 1872-6119 | eng |
| source.identifier.issn | 0020-0190 | eng |
| source.periodicalTitle | Information Processing Letters | eng |