Advertisement

Finding Triangles for Maximum Planar Subgraphs

  • Parinya Chalermsook
  • Andreas Schmid
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10167)

Abstract

In the Maximum Planar Subgraph (Mps) problem, we are given a graph G, and our goal is to find a planar subgraph H with maximum number of edges. Besides being a basic problem in graph theory, Mps has many applications including, for instance, circuit design, factory layout, and graph drawing, so it has received a lot of attention from both theoretical and empirical literature. Since the problem is NP-hard, past research has focused on approximation algorithms. The current best known approximation ratio is \(\frac{4}{9}\) obtained two decades ago (Călinescu et al. SODA 1996) based on computing as many edge-disjoint triangles in an input graph as possible. The factor of \(\frac{4}{9}\) is also the limit of this “disjoint triangles” approach.

This paper presents a new viewpoint that highlights the essences of known algorithmic results for Mps, as well as suggesting new directions for breaking the \(\frac{4}{9}\) barrier. In particular, we introduce the Maximum Planar Triangles (Mpt) problem: Given a graph G, compute a subgraph that admits a planar embedding with as many triangular faces as possible. Roughly speaking, any \(\rho \)-approximation algorithm for Mpt can easily be turned into a \(\frac{1}{3} + \frac{2 \rho }{3}\) approximation for Mps. We illustrate the power of the Mpt framework by “rephrasing” some known approximation algorithms for Mps as approximation algorithms for Mpt (solving Mps as by-products). This motivates us to perform a further rigorous study on the approximability of Mpt and show the following results:
  • Mpt is NP-hard, giving a simplified NP-hardness proof for Mps as a by-product.

  • We propose a natural class of greedy algorithms that captures all known greedy algorithms that have appeared in the literature. We show that a very simple greedy rule gives better approximation ratio than all known greedy algorithms (but still worse than \(\frac{4}{9}\)).

Our greedy results, despite not improving the approximation factor, illustrate the advantage of overlapping triangles in the context of greedy algorithms. The Mpt viewpoint offers various new angles that might be useful in designing a better approximation algorithm for Mps.

Notes

Acknowledgement

We are grateful to an anonymous reviewer, whose detailed suggestions contributed to a clearer presentation of this work.

References

  1. 1.
    Cai, J., Han, X., Tarjan, R.E.: An \(O(m \log n)\)-time algorithm for the maximal planar subgraph problem. SIAM J. Comput. 22(6), 1142–1162 (1993)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Călinescu, G., Fernandes, C.G., Finkler, U., Karloff, H.: A better approximation algorithm for finding planar subgraphs. J. Algorithms 27(2), 269–302 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Călinescu, G., Fernandes, C.G., Karloff, H.J., Zelikovsky, A.: A new approximation algorithm for finding heavy planar subgraphs. Algorithmica 36(2), 179–205 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Călinescu, G., Fernandes, C.G., Kaul, H., Zelikovsky, A.: Maximum series-parallel subgraph. Algorithmica 63(1–2), 137–157 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Chiba, T., Nishioka, I., Shirakawa, I.: An algorithm of maximal planarization of graphs. In: Proceedings of IEEE Symposium on Circuits and Systems, pp. 649–652 (1979)Google Scholar
  6. 6.
    Cimikowski, R., Coppersmith, D.: The sizes of maximal planar, outerplanar, and bipartite planar subgraphs. Discret. Math. 149(1–3), 303–309 (1996)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Faria, L., De Figueiredo, C.M.H., Mendonça, C.F.X.: On the complexity of the approximation of nonplanarity parameters for cubic graphs. Discret. Appl. Math. 141(1), 119–134 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Gonzalez, T.F.: Handbook of Approximation Algorithms and Metaheuristics. CRC Press, Boca Raton (2007)CrossRefzbMATHGoogle Scholar
  9. 9.
    Krishnamoorthy, M.S.: An NP hard problem in bipartite graphs. ACM SIGACT News 7(1), 26 (1975)CrossRefGoogle Scholar
  10. 10.
    Kühn, D., Osthus, D., Taraz, A.: Large planar subgraphs in dense graphs. J. Comb. Theory, Ser. B 95(2), 263–282 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Liu, P.C., Geldmacher, R.C.: On the deletion of nonplanar edges of a graph. In: Proceedings of 10th Southeastern Conference on Combinatorics, Graph Theory, and Computing, pp. 727–738 (1977)Google Scholar
  12. 12.
    Poranen, T.: Two new approximation algorithms for the maximum planar subgraph problem. Acta Cybern. 18(3), 503–527 (2008)MathSciNetzbMATHGoogle Scholar
  13. 13.
    Tamassia, R.: Handbook of Graph Drawing and Visualization. CRC Press, Boca Raton (2013)zbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Aalto UniversityEspooFinland
  2. 2.Max Planck Institute for InformaticsSaarbrückenGermany

Personalised recommendations