Strip Planarity Testing

Angelini, Patrizio and Da Lozzo, Giordano and Di Battista, Giuseppe and Frati, Fabrizio (2013) Strip Planarity Testing. In: 21st International Symposium, GD 2013, September 23-25, 2013 , pp. 37-48(Official URL: http://dx.doi.org/10.1007/978-3-319-03841-4_4).

Full text not available from this repository.

Abstract

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.

Item Type: Conference Paper
Classifications: G Algorithms and Complexity > G.770 Planarity Testing
P Styles > P.180 Cluster
P Styles > P.480 Layered
P Styles > P.840 Upward
Divisions: UNSPECIFIED
Depositing User: Administration GDEA
Date Deposited: 13 Aug 2014 16:16
Last Modified: 13 Aug 2014 16:16
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1359

Actions (login required)

View Item View Item