A Linear-Time Algorithm for Finding a Maximal Planar Subgraph


We construct an optimal linear-time algorithm for the maximal planar subgraph problem: given a graph G, find a planar subgraph G′ of G such that adding to G′ an extra edge of G results in a non-planar graph. Our solution is based on a fast data structure for incremental planarity testing of triconnected graphs and a dynamic graph search procedure. Our… (More)
DOI: 10.1137/S0895480197328771


6 Figures and Tables

Slides referencing similar topics