Inserting an edge into a planar graph
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Efficient subtyping tests with PQ-encoding
OOPSLA '01 Proceedings of the 16th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Computing Optimal Embeddings for Planar Graphs
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Graph Drawing Algorithm Engineering with AGD
Revised Lectures on Software Visualization, International Seminar
A new approach for visualizing UML class diagrams
Proceedings of the 2003 ACM symposium on Software visualization
A greedy random adaptive search procedure for the weighted maximal planar graph problem
Computers and Industrial Engineering
Automatic layout of UML class diagrams in orthogonal style
Information Visualization - Special issue: Software visualization
Efficient subtyping tests with PQ-encoding
ACM Transactions on Programming Languages and Systems (TOPLAS)
Experiments on exact crossing minimization using column generation
Journal of Experimental Algorithmics (JEA)
A linear time algorithm for finding a maximal planar subgraph based on PC-trees
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Advances in the planarization method: effective multiple edge insertions
GD'11 Proceedings of the 19th international conference on Graph Drawing
A branch-and-cut approach to the crossing number problem
Discrete Optimization
Hi-index | 0.03 |
The problem of computing a maximal planar subgraph of a nonplanar graph has been deeply investigated over the last 20 years. Several attempts have been tried to solve the problem with the help of PQ-trees. The latest attempt has been reported by Jayakumar et al. In this paper we show that the algorithm presented by Jayakumar et al. is not correct. We show that it does not necessarily compute a maximal planar subgraph and we note that the same holds for a modified version of the algorithm presented by Kant. Our conclusions most likely suggest not to use PQ-trees at all for this specific problem