Skip to main content

Advertisement

Springer Nature Link
Log in

Connected feedback vertex set on AT-free graphs

  • Research
  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

A connected feedback vertex set of a graph is a connected subgraph of the graph whose removal makes the graph cycle free. In this paper, we provide an approximation algorithm for connected feedback vertex set in AT-free graphs. Given an \(\alpha \)-approximate solution for feedback vertex set on 2-connected AT-free graph, our algorithm produces a solution of size \(((\alpha +0.9091)OPT+6)\) for connected feedback vertex set on the same graph. The complexity of our algorithm is \(O(f(n)+(m+n))\), where the time required to obtain the \(\alpha \)-approximate solution is O(f(n)). Our result leads to the following two observations. The optimal feedback vertex set algorithm for AT-free graphs combined with our result provides an algorithm which produces a solution of size \((1.9091OPT+6)\) with running time \(O(n^8m^2)\) for 2-connected AT-free graphs. The 2-approximation algorithm for feedback vertex set in general graphs along with our result provides an algorithm which produces a solution of size \((2.9091OPT+6)\) with running time \(O(min\{m(log(n)),n^2\})\). Using the same method we also obtain a \(((\alpha +1)OPT+6)\)-approximation for this problem on general AT-free graphs. We note that, the complexity status of this problem is not known.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Algorithm 1
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. Abrishami, T., Chudnovsky, M., Pilipczuk, M., Rzążewski, P., Seymour, P.: Induced subgraphs of bounded treewidth and the container method. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1948–1964. SIAM (2021)

  2. Bafna, V., Berman, P., Fujito, T.: A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM J. Discrete Math. 12(3), 289–297 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  3. Balakrishnan, H., Rajaraman, A., Rangan, C.P.: Connected domination and steiner set on asteroidal triple-free graphs. In: Algorithms and Data Structures: Third Workshop, WADS’93 Montréal, Canada, August 11–13, 1993 Proceedings 3, pp. 131–141. Springer (1993)

  4. Belmonte, R., Hof, P.V., Kamiński, M., Paulusma, D.: The price of connectivity for feedback vertex set. Discrete Appl. Math. 217, 132–143 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bergougnoux, B., Dreier, J., Jaffke, L.: A logic-based algorithmic meta-theorem for mim-width. In: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 3282–3304. SIAM (2023)

  6. Broersma, H., Kloks, T., Kratsch, D., Müller, H.: Independent sets in asteroidal triple-free graphs. SIAM J. Discrete Math. 12(2), 276–287 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  7. Chiarelli, N., Hartinger, T.R., Johnson, M., Milanič, M., Paulusma, D.: Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity. Theor. Comput. Sci. 705, 75–83 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  8. Corneil, D.G., Olariu, S., Stewart, L.: Computing a dominating pair in an asteroidal triple-free graph in linear time. In: Workshop on Algorithms and Data Structures, pp. 358–368. Springer (1995)

  9. Corneil, D.G., Olariu, S., Stewart, L.: Asteroidal triple-free graphs. SIAM J. Discrete Math. 10(3), 399–430 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  10. Dabrowski, K.K., Feghali, C., Johnson, M., Paesani, G., Paulusma, D., Rzążewski, P.: On cycle transversals and their connected variants in the absence of a small linear forest. Algorithmica 82(10), 2841–2866 (2020)

    Article  MathSciNet  MATH  Google Scholar 

  11. Grigoriev, A., Sitters, R.: Connected feedback vertex set in planar graphs. In: International Workshop on Graph-Theoretic Concepts in Computer Science, pp. 143–153. Springer (2009)

  12. Gross, J.L., Yellen, J., Anderson, M.: Graph Theory and Its Applications. Chapman and Hall/CRC, Boca Raton (2018)

    Book  MATH  Google Scholar 

  13. Hartmanis, J.: SIAM Rev. Computers and intractability: a guide to the theory of NP-completeness (Michael R. Garey and David S. Johnson) 24(1), 90 (1982)

    MathSciNet  Google Scholar 

  14. Kratsch, D.: Domination and total domination on asteroidal triple-free graphs. Discrete Appl. Math. 99(1–3), 111–123 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  15. Kratsch, D., Müller, H., Todinca, I.: Feedback vertex set on AT-free graphs. Discrete Appl. Math. 156(10), 1936–1947 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  16. Liang, Y.D.: On the feedback vertex set problem in permutation graphs. Inf. Process. Lett. 52(3), 123–129 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  17. Liang, Y.D., Chang, M.-S.: Minimum feedback vertex sets in cocomparability graphs and convex bipartite graphs. Acta Inform. 34(5), 337 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  18. Lu, C.L., Tang, C.Y.: A linear-time algorithm for the weighted feedback vertex problem on interval graphs. Inf. Process. Lett. 61(2), 107–111 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  19. Misra, N., Philip, G., Raman, V., Saurabh, S., Sikdar, S.: FPT algorithms for connected feedback vertex set. J. Comb. Optim. 24(2), 131–146 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  20. Munaro, A.: On line graphs of subcubic triangle-free graphs. Discrete Math. 340(6), 1210–1226 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  21. Ramanujan, M. S.: An approximate kernel for connected feedback vertex set. In: 27th Annual European Symposium on Algorithms (ESA 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2019)

  22. West, D.B., et al.: Introduction to Graph Theory, vol. 2. Prentice Hall Upper Saddle River, Hoboken (2001)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ramakrishna Mission Vivekananda Educational and Research Institute, Belur, India

    Joydeep Mukherjee & Tamojit Saha

  2. Institute of Advancing Intelligence, TCG CREST, Kolkata, India

    Tamojit Saha

Authors
  1. Joydeep Mukherjee
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Tamojit Saha
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Tamojit Saha.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mukherjee, J., Saha, T. Connected feedback vertex set on AT-free graphs. Acta Informatica 62, 2 (2025). https://doi.org/10.1007/s00236-024-00469-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s00236-024-00469-5