Abstract
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.
Cite
CITATION STYLE
Binucci, C., Chimani, M., Didimo, W., Gronemann, M., Klein, K., Kratochvìl, J., … Tollis, I. G. (2015). 2-layer fan-planarity: From caterpillar to stegosaurus. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9411, pp. 281–294). Springer Verlag. https://doi.org/10.1007/978-3-319-27261-0_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
