2-layer fan-planarity: From caterpillar to stegosaurus

DC FieldValueLanguage
dc.contributor.authorBinucci, C.
dc.contributor.authorChimani, M.
dc.contributor.authorDidimo, W.
dc.contributor.authorGronemann, M.
dc.contributor.authorKlein, K.
dc.contributor.authorKratochvìl, J.
dc.contributor.authorMontecchiani, F.
dc.contributor.authorTollis, I.G.
dc.contributor.editorDi Giacomo, E.
dc.contributor.editorLubiw, A.
dc.date.accessioned2021-12-23T16:32:30Z-
dc.date.available2021-12-23T16:32:30Z-
dc.date.issued2015
dc.identifier.isbn9783319272603
dc.identifier.issn03029743
dc.identifier.urihttps://osnascholar.ub.uni-osnabrueck.de/handle/unios/17384-
dc.descriptionConference of 23rd International Symposium on Graph Drawing and Network Visualization, GD 2015 ; Conference Date: 24 September 2015 Through 26 September 2015; Conference Code:159389
dc.description.abstractIn a fan-planar drawing of a graph there is no edge that crosses two other independent edges. We study 2-layer fan-planar drawings, i.e., fan-planar drawings such that the vertices are assigned to two distinct horizontal layers and edges are straight-line segments that connect vertices of different layers. We characterize 2-layer fan-planar drawable graphs and describe a linear-time testing and embedding algorithm for biconnected graphs. We also study the relationship between 2-layer fan-planar graphs and 2-layer right-angle crossing graphs. © Springer International Publishing Switzerland 2015.
dc.description.sponsorshipMinistero dell'Istruzione, dell'Università e della RicercaMinistero dell'Istruzione, dell'Università e della Ricerca,MIUR,2012C4E3KT 001; Research supported in part by the MIUR project AMANDA ?Algorithmics for MAssive and Networked DAta?, prot. 2012C4E3KT 001 and by the Australian Research Council through Discovery Project grant DP140100077. Work by Jan Kratochvl was supported by the grant no. 14-14179S of the Czech Science Foundation GACR. The research in this work initiated at the Bertinoro Workshop on Graph Drawing 2015, supported by the European Science Foundation as part of the EuroGIGA collaborative research program (Graphs in Geometry and Algorithms).; California State University at; Microsoft; Northridge; Springer; Tom Sawyer Software and yWorks
dc.language.isoen
dc.publisherSpringer Verlag
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.subjectDrawing (graphics)
dc.subjectVisualization, Different layers
dc.subjectEmbedding algorithms
dc.subjectHorizontal layers
dc.subjectIndependent edges
dc.subjectLinear time
dc.subjectPlanar drawing
dc.subjectPlanar graph
dc.subjectStraight-line segments, Graphic methods
dc.title2-layer fan-planarity: From caterpillar to stegosaurus
dc.typeconference paper
dc.identifier.doi10.1007/978-3-319-27261-0_24
dc.identifier.scopus2-s2.0-84952020275
dc.identifier.urlhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84952020275&doi=10.1007%2f978-3-319-27261-0_24&partnerID=40&md5=1049eb5dd1742fd2871f3ef3b5ee8afe
dc.description.volume9411
dc.description.startpage281
dc.description.endpage294
dcterms.isPartOf.abbreviationLect. Notes Comput. Sci.
crisitem.author.orcid0000-0002-4681-5550-
crisitem.author.netidChMa572-
Show simple item record

Page view(s)

6
Last Week
1
Last month
1
checked on May 20, 2024

Google ScholarTM

Check

Altmetric