Algorithms and Characterizations for 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%2F17%3A10368374" target="_blank" >RIV/00216208:11320/17:10368374 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.7155/jgaa.00398" target="_blank" >http://dx.doi.org/10.7155/jgaa.00398</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.7155/jgaa.00398" target="_blank" >10.7155/jgaa.00398</a>

Result language
angličtina
Original language name
Algorithms and Characterizations for 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 restricted to two distinct hori- zontal 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
—

Type
J<sub>SC</sub> - Article in a specialist periodical, which is included in the SCOPUS database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/GA14-14179S" target="_blank" >GA14-14179S: Algorithmic, structural and complexity aspects of configurations in the plane</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)