An $O(m\log N)$-Time Algorithm for the Maximal Planar Subgraph Problem
SIAM Journal on Computing - United States
doi 10.1137/0222068
Full Text
Open PDFAbstract
Available in full text
Date
December 1, 1993
Authors
Publisher
Society for Industrial & Applied Mathematics (SIAM)