A Better Algorithm for Finding Planar Subgraph.pptVIP

A Better Algorithm for Finding Planar Subgraph Gruia C?linescu Cristina G. Fernandes Ulrich Finkler Howard Karloff Introduction 4/9-approxi. algorithm for maximum planar subgraph problem 2/3-approxi. algorithm for Outer-planar subgraphs( all vertices on the boundary) Maximum planar subgraph problem and its complement ( removing as few edges as possible to leave a planar subgraph) are Max SNP-hard Maximum planar subgraph problem given a graph G, find a planar subgraph of G with the maximum number of edges. NP-complete The simplest algorithm : Spanning tree (assume G is connected.) Maximal pla