An O(m Log N) Time Algorithm for the Maximal Planar Subgraph Problem (Classic Reprint)

Bok av Jiazhen Cai