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

Jiazhen Cai, Xiaofeng Han, Robert E. Tarjan

Research output: Contribution to journalArticlepeer-review

43 Scopus citations

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.

Mathematics

Engineering & Materials Science