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

MPI-I-98-1-008. March 1998, 5 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
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
Acknowledgement:
References to related material:

To download this research report, please select the type of document that fits best your needs.	Attachement Size(s):
	442 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView

URL to this document: http://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},}