A Linear-Time Algorithm for Finding a Maximal Planar Subgraph

Hristo Djidjev. A Linear-Time Algorithm for Finding a Maximal Planar Subgraph. SIAM J. Discrete Math., 20(2):444-462, 2006. [doi]

Abstract

Abstract is missing.