Michael Junger, Sebastian Leipert, and Petra Mutzel. Pitfalls of Using PQ-Trees in Automatic Graph Drawing. In Giuseppe Di Battista, editor, Proceedings of the Symposium on Graph Drawing, GD'97, pages 193--204. Springer-Verlag, Lecture Notes in Computer Science, vol. 1353, 1997. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Planarizing Graphs - A Survey and Annotated Bibliography - Liebers (2001) (6 citations) (Correct)
....one to find a spanning planar subgraph of a 2 connected graph G, and one to find a maximal planar subgraph by augmenting the previously found spanning planar subgraph. The latter algorithm is shown to be incorrect by [Kan92, Kan93] claiming to show how to correct the algorithm. Lei94, JLM97] in turn point out that the result in [Kan92] is not correct either and discuss the di#culties of using PQ trees. Di Battista and Tamassia [DT89, DT96b] DT90, DT96a] define and use SPQR trees to describe the recursive decomposition of a 2 connected graph into its 3 connected components. DT89] ....
Michael Junger, Sebastian Leipert, and Petra Mutzel. Pitfalls of Using PQ-Trees in Automatic Graph Drawing. In Giuseppe Di Battista, editor, Proceedings of the Symposium on Graph Drawing, GD'97, pages 193--204. Springer-Verlag, Lecture Notes in Computer Science, vol. 1353, 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC