


default search action
"An O(m log n)-Time Algorithm for the Maximal Planar Subgraph Problem."
Jiazhen Cai, Xiaofeng Han, Robert Endre Tarjan (1993)
- Jiazhen Cai, Xiaofeng Han, Robert Endre Tarjan:
An O(m log n)-Time Algorithm for the Maximal Planar Subgraph Problem. SIAM J. Comput. 22(6): 1142-1162 (1993)

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.