In this paper we introduce and study the strip planarity testing problem, which takes as an input a planar graph G(V,E) and a function γ: V → {1,2,...,k} and asks whether a planar drawing of G exists such that each edge is monotone in the y-direction and, for any u, v ∈ V with γ(u) < γ(v), it holds y(u) < y(v). The problem has strong relationships with some of the most deeply studied variants of the planarity testing problem, such as clustered planarity, upward planarity, and level planarity. We show that the problem is polynomial-time solvable if G has a fixed planar embedding. © 2013 Springer International Publishing Switzerland.
CITATION STYLE
Angelini, P., Da Lozzo, G., Di Battista, G., & Frati, F. (2013). Strip planarity testing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8242 LNCS, pp. 37–48). Springer Verlag. https://doi.org/10.1007/978-3-319-03841-4_4
Mendeley helps you to discover research relevant for your work.