Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems

@article{Morgan2007ApproximationAF,
  title={Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems},
  author={Kerri Morgan and Graham Farr},
  journal={J. Graph Algorithms Appl.},
  year={2007},
  volume={11},
  pages={165-193}
}
The task of finding the largest subset of vertices of a graph that induces a planar subgraph is known as the Maximum Induced Planar Subgraph problem (MIPS). In this paper, some new approximation algorithms for MIPS are introduced. The results of an extensive study of the performance of these and existing MIPS approximation algorithms on randomly generated graphs are presented. Efficient algorithms for finding large induced outerplanar graphs are also given. One of these algorithms is shown to… CONTINUE READING

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…