Basit öğe kaydını göster

dc.contributor.authorBrandes, Ulriken_US
dc.contributor.authorErten, Cesimen_US
dc.contributor.authorFowler, J. Josephen_US
dc.contributor.authorFrati, Fabrizioen_US
dc.contributor.authorGeyer, Markusen_US
dc.contributor.authorGutwenger, Carstenen_US
dc.contributor.authorHong, Seok-Heeen_US
dc.contributor.authorKaufmann, Michaelen_US
dc.contributor.authorKobourov, Stephen G.en_US
dc.contributor.authorLiotta, Giuseppeen_US
dc.contributor.authorMutzel, Petraen_US
dc.contributor.authorSymvonis, Antoniosen_US
dc.date.accessioned2019-08-31T12:10:23Z
dc.date.accessioned2019-08-05T16:03:06Z
dc.date.available2019-08-31T12:10:23Z
dc.date.available2019-08-05T16:03:06Z
dc.date.issued2007
dc.identifier.citationBrandes, U., Erten, C., Fowler, J., Frati, F., Geyer, M., Gutwenger, C., . . . & Symvonis, A. (2007). Colored simultaneous geometric embeddings. Paper presented at the Computing And Combinatorics, Proceedings, 4598, 254-263.doi:10.1007/978-3-540-73545-8_26en_US
dc.identifier.isbn9783540735441
dc.identifier.issn0302-9743
dc.identifier.issn1611-3349
dc.identifier.urihttps://hdl.handle.net/11729/1813
dc.identifier.urihttps://dx.doi.org/10.1007/978-3-540-73545-8_26
dc.description.abstractWe 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.en_US
dc.language.isoengen_US
dc.publisherSpringer-Verlag Berlinen_US
dc.relation.ispartofseriesLecture Notes in Computer Scienceen_US
dc.relation.isversionof10.1007/978-3-540-73545-8_26
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectBlue pointen_US
dc.subjectComputer graphicsen_US
dc.subjectComputer simulationen_US
dc.subjectDrawing (forming)en_US
dc.subjectDrawing (graphics)en_US
dc.subjectEmbedded systemsen_US
dc.subjectEulerian circuiten_US
dc.subjectGeometric embeddingsen_US
dc.subjectOuterplanar graphen_US
dc.subjectPlanar drawingen_US
dc.subjectPlanar graphen_US
dc.subjectPlane drawingen_US
dc.titleColored simultaneous geometric embeddingsen_US
dc.typeconferenceObjecten_US
dc.description.versionPublisher's Versionen_US
dc.relation.journalComputing And Combinatorics, Proceedingsen_US
dc.contributor.departmentIşık Üniversitesi, Mühendislik Fakültesi, Bilgisayar Mühendisliği Bölümüen_US
dc.contributor.departmentIşık University, Faculty of Engineering, Department of Computer Engineeringen_US
dc.contributor.authorID0000-0002-8149-7113
dc.identifier.volume4598
dc.identifier.startpage254
dc.identifier.endpage263
dc.peerreviewedYesen_US
dc.publicationstatusPublisheden_US
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.contributor.institutionauthorErten, Cesimen_US
dc.relation.indexWOSen_US
dc.relation.indexScopusen_US
dc.relation.indexConference Proceedings Citation Index – Science (CPCI-S)en_US
dc.description.qualityQ4
dc.description.wosidWOS:000248102000023


Bu öğenin dosyaları:

Thumbnail

Bu öğe aşağıdaki koleksiyon(lar)da görünmektedir.

Basit öğe kaydını göster