Approximation algorithms for the maximum induced planar and outerplanar subgraph problems

被引：3
作者：
Morgan, Kerri [1 ]
Farr, Graham [1 ]
机构：
[1] Clayton School of Information Technology, Monash University
来源：
Journal of Graph Algorithms and Applications | 2007年 / 11卷 / 01期
关键词：
Graph theory;
D O I：
10.7155/jgaa.00141
中图分类号：
学科分类号：
摘要：
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 find 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.
引用
收藏
页码：165 / 193
页数：28
相关论文
共 19 条
  • [11] Halldorsson M.M., Lau H., Low-degree graph partitioning via local search with applications to constraint satisfaction, max cut, and colouring, J. Graph Algorithms Appl, 1, pp. 1-13, (1997)
  • [12] Hassan M., Hogg G., A review of graph theory application to the facilities layout problem, Omega, 15, pp. 291-300, (1987)
  • [13] Junger M., Mutzel P., Maximum planar subgraphs and nice embeddings: Practical layout tools, Algorithmica, 16, pp. 33-59, (1996)
  • [14] Liebers A., Planarizing graphs - a survey and annotated bibliography, J. Graph Algorithms Appl, 5, pp. 1-74, (2001)
  • [15] Lipton R., Tarjan R., A separator theorem for planar graphs, SIAM J. on Appl. Math, 36, pp. 177-189, (1979)
  • [16] Lovasz L., On decomposition of graphs, Studia Sci. Math. Hungar, 1, pp. 237-238, (1966)
  • [17] Steger A., Wormald N., Generating random regular graphs quickly, Combin. Probab. Comput, 8, pp. 377-396, (1999)
  • [18] Wormald N., Models of random regular graphs, London Mathematical Society Lecture Note Series, 267, pp. 239-298, (1999)
  • [19] Yannakakis M., Node- and edge-deletion NP-complete problems, STOC '78: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, pp. 253-264, (1978)
12