An O(m log n)-Time Algorithm for the Maximal Planar Subgraph Problem (1993)

Cached

Download Links

by Jiazhen Cai , Xiaofeng Han , Robert E. Tarjan
Citations:17 - 0 self

Document Versions

An O(m log n)-Time Algorithm for the Maximal Planar Subgraph Problem –Jiazhen Cai, Xiaofeng Han, Robert E. Tarjan — 1993