Skip to main navigation Skip to search Skip to main content

O(m log n)-time algorithm for the maximal planar subgraph problem

Research output: Contribution to journal › Article › peer-review

Fingerprint

Dive into the research topics of 'O(m log n)-time algorithm for the maximal planar subgraph problem'. Together they form a unique fingerprint.
Sort by

Keyphrases

Mathematics

Computer Science