MPI-INF/SWS Research Reports 1991-2021
2. Number - All Departments
MPI-I-98-1-008
A note on computing a maximal planar subgraph using PQ-trees
Jünger, Michael and Leipert, Sebastian and Mutzel, Petra
March 1998, 5 pages.
.Status: available - back from printing
The problem of computing a maximal planar subgraph of a non planar 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. [10].
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 [12]. Our conclusions most
likely suggest not to use PQ-trees at all for this specific problem.
Note:
to appear in IEEE Transactions on Computer Aided-Design 1998
-
- Attachement: MPI-I-98-1-008.ps (442 KBytes)
URL to this document: https://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1998-1-008
BibTeX@TECHREPORT{J'ungerLeipertMutzel98,
AUTHOR = {J{\"u}nger, Michael and Leipert, Sebastian and Mutzel, Petra},
TITLE = {A note on computing a maximal planar subgraph using PQ-trees},
TYPE = {Research Report},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
NUMBER = {MPI-I-98-1-008},
MONTH = {March},
YEAR = {1998},
ISSN = {0946-011X},
NOTE = {to appear in IEEE Transactions on Computer Aided-Design 1998},
}