2-Layer Fan-Planarity: From Caterpillar to Stegosaurus

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F15%3A10319874" target="_blank" >RIV/00216208:11320/15:10319874 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-319-27261-0_24" target="_blank" >http://dx.doi.org/10.1007/978-3-319-27261-0_24</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-27261-0_24" target="_blank" >10.1007/978-3-319-27261-0_24</a>

Result language
angličtina
Original language name
2-Layer Fan-Planarity: From Caterpillar to Stegosaurus
Original language description
In 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.
Czech name
—
Czech description
—

Project
<a href="/en/project/GA14-14179S" target="_blank" >GA14-14179S: Algorithmic, structural and complexity aspects of configurations in the plane</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Graph Drawing and Network Visualization - 23rd International Symposium, GD 2015
ISBN
978-3-319-27260-3
ISSN
0302-9743
e-ISSN
—
Number of pages
14
Pages from-to
281-294
Publisher name
Springer
Place of publication
New York
Event location
Los Angeles
Event date
Sep 24, 2015
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)