Pitfalls of using PQ-Trees in Automatic Graph Drawing

Pitfalls of using PQ-Trees in Automatic Graph Drawing (1997)

by Michael Jünger , Sebastian Leipert , Petra Mutzel

Citations:

10 - 0 self

User correction supplied by mph

Datum	Value	Source
TITLE	Pitfalls of using PQ-Trees in Automatic Graph Drawing	SVM HeaderParse 0.1
AUTHOR NAME	Michael Jünger	user correction
AUTHOR AFFIL	Effiziente Algorithmen fur diskrete Probleme und ihre Anwendungen; (ALCOM-IT).; Institut fur Informatik; Universitat zu Koln	user correction
AUTHOR ADDR	Pohligstrae 1; 50969 Koln	user correction
AUTHOR NAME	Sebastian Leipert	user correction
AUTHOR AFFIL		user correction
AUTHOR NAME	Petra Mutzel	user correction
AUTHOR AFFIL	Institut fur Informatik, Universitat zu Koln	user correction
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.	user correction
YEAR	1997	SVM HeaderParse 0.1
CITATIONS	12 found	ParsCit 1.0