Pitfalls of Using PQ-Trees in Automatic Graph Drawing

Jünger, Michael and Leipert, Sebastian and Mutzel, Petra (1998) Pitfalls of Using PQ-Trees in Automatic Graph Drawing. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997 , pp. 193-204(Official URL: http://dx.doi.org/10.1007/3-540-63938-1_62).

This is the latest version of this item.

Full text not available from this repository.


A number of erroneous attempts involving PQ-trees in the context of automatic graph drawing algorithms have been presented in the literature in recent years. In order to prevent future research from constructing algorithms with similar errors we point out some of the major mistakes. In particular, we examine erroneous usage of the PQ-tree data structure in algorithms for computing maximal planar subgraphs and an algorithm for testing leveled planarity of leveled directed acyclic graphs with several sources and sinks.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-63938-1_62
Classifications: G Algorithms and Complexity > G.999 Others
G Algorithms and Complexity > G.770 Planarity Testing
URI: http://gdea.informatik.uni-koeln.de/id/eprint/79

Available Versions of this Item

Actions (login required)

View Item View Item