English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

A Note on Computing a Maximal Planar Subgraph using PQ-Trees

MPS-Authors

Jünger,  Michael
Max Planck Society;

/persons/resource/persons44906

Leipert,  Sebastian
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45092

Mutzel,  Petra
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Jünger, M., Leipert, S., & Mutzel, P. (1998). A Note on Computing a Maximal Planar Subgraph using PQ-Trees. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 17(7), 609-612.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-375D-0
Abstract
There is no abstract available