Level Planarity Testing in Linear Time

Jünger, Michael and Leipert, Sebastian and Mutzel, Petra (1998) Level Planarity Testing in Linear Time. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998 , pp. 224-237(Official URL: http://dx.doi.org/10.1007/3-540-37623-2_17).

This is the latest version of this item.

Full text not available from this repository.


In a leveled directed acyclic graph G = (V,E) the vertex set V is partitioned into k \le |V| levels V_1, V_2,...,V_k such that for each edge (u.v) \in E with u \in V_i and v \in V_j we have i<j. The level planarity testing problem is to decide if G can be drawn in the plane such that for each level Vi, all v \in V_i are drawn on the line l_i={(x,k-i)|x \in R}, the edges are drawn monotone with respect to the vertical direction, and no edges intersect except at their end vertices. If G has a single source,the test can be performed in O(|V|) time by an algorithm of Di Battista and Nardelli (1988) that uses the PQ-tree data structure introduced by Booth and Lueker (1976). PQ-trees have also been proposed by Heath and Pemmaraju (1996a,b) to test level planarity of leveled directed acyclic graphs with several sources and sinks. It has been shown in Jünger, Leipert, and Mutzel (1997) that this algorithm is not correct in the sense that it does not state correctly level planarity of every level planar graph. In this paper, we present a correct linear time level planarity testing algorithm that is based on two main new techniques that replace the incorrect crucial parts of the algorithm of Heath and Pemmaraju (1996a,b).

Item Type: Conference Paper
Additional Information: 10.1007/3-540-37623-2_17
Classifications: G Algorithms and Complexity > G.700 Layering
M Methods > M.600 Planar
G Algorithms and Complexity > G.770 Planarity Testing
URI: http://gdea.informatik.uni-koeln.de/id/eprint/265

Available Versions of this Item

Actions (login required)

View Item View Item