Pitfalls of using PQ-trees in Automatic Graph Drawing

Jünger, Michael and Leipert, Sebastian and Mutzel, Petra (1997) Pitfalls of using PQ-trees in Automatic Graph Drawing.
Published In: Graph drawing : 5th international symposium, GD '97, Rome, Italy, September 18 - 20, 1997 ; proceedings, Lecture notes in computer science. 1353 Springer 1997, pp. 193-204.


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.

Download: [img] Postscript - Preprinted Version
Download (622kB) | Preview
Editorial actions: View Item View Item (Login required)
Content information:
Deposit Information:
ZAIK Number: zpr97-278
Depositing User: Prof. Dr. Michael Jünger
Date Deposited: 24 Jun 2003 00:00
Last Modified: 19 Jan 2012 09:44
URI: http://e-archive.informatik.uni-koeln.de/id/eprint/278