Colored Simultaneous Geometric Embeddings

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:73f6c60e14c5463e2e96479b6445bc36

BRANDES, Ulrik, Cesim ERTEN, James FOWLER, Fabrizio FRATI, Markus GEYER, Carsten GUTWENGER, Seokhee HONG, Michael KAUFMANN, Stephen G. KOBOUROV, Giuseppe LIOTTA, 2007. Colored Simultaneous Geometric Embeddings. In: Computing and combinatorics : 13th annual international conference, COCOON 2007, Banff, Canada, July 16 - 19, 2007. Berlin [u.a.]:Springer, pp. 254-263. ISBN 978-3-540-73544-1

@inproceedings{Brandes2007Color-5893, title={Colored Simultaneous Geometric Embeddings}, year={2007}, number={4598}, isbn={978-3-540-73544-1}, address={Berlin [u.a.]}, publisher={Springer}, series={Lecture Notes in Computer Science}, booktitle={Computing and combinatorics : 13th annual international conference, COCOON 2007, Banff, Canada, July 16 - 19, 2007}, pages={254--263}, author={Brandes, Ulrik and Erten, Cesim and Fowler, James and Frati, Fabrizio and Geyer, Markus and Gutwenger, Carsten and Hong, Seokhee and Kaufmann, Michael and Kobourov, Stephen G. and Liotta, Giuseppe} }

<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/5893"> <dc:contributor>Liotta, Giuseppe</dc:contributor> <dc:contributor>Gutwenger, Carsten</dc:contributor> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:01:12Z</dc:date> <dc:contributor>Kobourov, Stephen G.</dc:contributor> <dc:contributor>Frati, Fabrizio</dc:contributor> <dc:creator>Brandes, Ulrik</dc:creator> <dc:creator>Liotta, Giuseppe</dc:creator> <dcterms:abstract xml:lang="eng">We introduce the concept of colored simultaneous geometric embeddings as a generalization of simultaneous graph embeddings with and without mapping. We show that there exists a universal pointset of size n for paths colored with two or three colors. We use these results to show that colored simultaneous geometric embeddings exist for: (1) a 2-colored tree together with any number of 2-colored paths and (2) a 2-colored outerplanar graph together with any number of 2-colored paths. We also show that there does not exist a universal pointset of size n for paths colored with five colors. We finally show that the following simultaneous embeddings are not possible: (1) three 6-colored cycles, (2) four 6-colored paths, and (3) three 9-colored paths.</dcterms:abstract> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:01:12Z</dcterms:available> <dc:contributor>Kaufmann, Michael</dc:contributor> <dc:creator>Hong, Seokhee</dc:creator> <dcterms:bibliographicCitation>First publ. in: Proceedings of the 13th Annual International Computing and Combinatorics Conference (COCOON ´07) (LNCS 4598), 2007, pp. 254-263</dcterms:bibliographicCitation> <dc:contributor>Hong, Seokhee</dc:contributor> <dc:contributor>Fowler, James</dc:contributor> <dcterms:title>Colored Simultaneous Geometric Embeddings</dcterms:title> <dc:creator>Frati, Fabrizio</dc:creator> <dcterms:rights rdf:resource="https://creativecommons.org/licenses/by-nc-nd/2.0/legalcode"/> <dcterms:issued>2007</dcterms:issued> <dc:contributor>Erten, Cesim</dc:contributor> <dc:language>eng</dc:language> <dc:contributor>Brandes, Ulrik</dc:contributor> <dc:creator>Kaufmann, Michael</dc:creator> <dc:rights>deposit-license</dc:rights> <dc:contributor>Geyer, Markus</dc:contributor> <dc:creator>Gutwenger, Carsten</dc:creator> <dc:creator>Erten, Cesim</dc:creator> <dc:format>application/pdf</dc:format> <dc:creator>Kobourov, Stephen G.</dc:creator> <dc:creator>Fowler, James</dc:creator> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5893"/> <dc:creator>Geyer, Markus</dc:creator> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

beffgghkklms_csge_07.pdf 46

Das Dokument erscheint in:

deposit-license Solange nicht anders angezeigt, wird die Lizenz wie folgt beschrieben: deposit-license

KOPS Suche


Stöbern

Mein Benutzerkonto