A linear time algorithm for finding maximal planar subgraphs
From MaRDI portal
(Redirected from A linear time algorithm for finding maximal planar subgraphs)
WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.