Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems

Kerri Morgan, Graham Farr
<span title="">2007</span> <i title="Journal of Graph Algorithms and Applications"> <a target="_blank" rel="noopener" href="" style="color: black;">Journal of Graph Algorithms and Applications</a> </i> &nbsp;
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
more &raquo; ... nd an induced outerplanar subgraph with at least 3n/(d + 5/3) vertices for graphs of n vertices with maximum degree at most d. The results presented in this paper indicate that most existing algorithms perform substantially better than the existing lower bounds indicate.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="">doi:10.7155/jgaa.00141</a> <a target="_blank" rel="external noopener" href="">fatcat:472ryjbh25amvkdipm5uourhum</a> </span>
<a target="_blank" rel="noopener" href="" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href=""> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / </button> </a>