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, Rome, Italy , 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.

Abstract

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
ID Code:79

Available Versions of this Item

Repository Staff Only: item control page

References

Booth, K. and Lueker, G. (1976). Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. Journal of Computer and System Sciences, 13, 335-379.

Chiba, N., Nishizeki, T., Abe, S., and Ozawa, T. (1985). A linear algorithm for embedding planar graphs using PQ-trees. Journal of Computer and System Sciences, 30, 54-76.

Di Battista, G. and Nardelli, E. (1988). Hierarchies and planarity theory. IEEE Transactions on systems, man, and cybernetics, 18(6), 1035-1046.

Even, S. (1979). Graph Algorithms. Computer Science Press, Potomac, Maryland.

Even, S. and Tarjan, R.E. (1976). Computing an st-numbering. Theoretical Computer Science, 2, 339-344.

Heath, L. and Pemmaraju, S. (1996a). Recognizing leveled-planar dags in linear time. In F.J. Brandenburg, editor, Proc. Graph Drawing '95, volume 1027 of Lecture Notes in Computer Science, pages 300-311. Springer Verlag.

Heath, L. and Pemmaraju, S. (1996b). Stack and queue layouts of directed acyclic graphs: Part II. Technical report, Department of Computer Science, Virginia Polytechnic Institute & State University.

Jayakumar, R., Thulasiraman, K., and Swamy, M. (1986). On maximal planarization of non-planar graphs. IEEE Transactions on Circuits Systems, 33(8), 843-844.

Jayakumar, R., Thulasiraman, K., and Swamy, M. (1989). On O(n²) algorithms for graph planarization. IEEE Transactions on Computer-Aided Design, 8(3), 257-267.

Jünger, M., Leipert, S., and Mutzel, P. (1996). On computing a maximal planar subgraph using PQ-trees. Technical Report 96.227, Institut für Informatik der Universität zu Köln.

Kant, G. (1992). An O(n²) maximal planarization algorithm based on PQ-trees. Technical Report RUU-CS-92-03, Departement of Computer Science, Utrecht University.

Lempel, A., Even, S., and Cederbaum, I. (1967). An Algorithm for planarity testing of graphs. In Theory of Graphs: International Symposium: Rome, July 1966, pages 215-232. Gordon and Breach, New York.

Ozawa, T. and Takahashi, H. (1981). A graph-planarization algorithm and its application to random graphs. In Graph Theory and Algorithms, volume 108 of Lecture Notes in Computer Science, pages 95-107. Springer Verlag.