Advertisement

Algorithmica

, Volume 79, Issue 1, pp 271–290 | Cite as

Quick but Odd Growth of Cacti

  • Sudeshna Kolay
  • Daniel Lokshtanov
  • Fahad Panolan
  • Saket Saurabh
Article

Abstract

Let \({\mathcal {F}}\) be a family of graphs. Given an n-vertex input graph G and a positive integer k, testing whether G has a vertex subset S of size at most k, such that \(G-S\) belongs to \({\mathcal {F}}\), is a prototype vertex deletion problem. These type of problems have attracted a lot of attention in recent times in the domain of parameterized complexity. In this paper, we study two such problems; when \({\mathcal {F}}\) is either the family of forests of cacti or the family of forests of odd-cacti. A graph H is called a forest of cacti if every pair of cycles in H intersect on at most one vertex. Furthermore, a forest of cacti H is called a forest of odd cacti, if every cycle of H is of odd length. Let us denote by \({\mathcal {C}}\) and \({{\mathcal {C}}}_\mathsf{odd}\), the families of forests of cacti and forests of odd cacti, respectively. The vertex deletion problems corresponding to \({\mathcal {C}}\) and \({{\mathcal {C}}}_\mathsf{odd}\) are called Diamond Hitting Set and Even Cycle Transversal, respectively. In this paper we design randomized algorithms with worst case run time \(12^k n^{\mathcal {O}(1)}\) for both these problems. Our algorithms considerably improve the running time for Diamond Hitting Set and Even Cycle Transversal, compared to what is known about them.

Keywords

Even Cycle Transversal Diamond Hitting Set Fixed parameter tractability Randomized algorithms 

Notes

Acknowledgements

The authors would like to thank the anonymous reviewers for their valuable comments and suggestions which helped us improve the quality of the paper.

References

  1. 1.
    Arkin, E.M., Papadimitriou, C.H., Yannakakis, M.: Modularity of cycles and paths in graphs. J. ACM 38(2), 255–274 (1991)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Becker, A., Bar-Yehuda, R., Geiger, D.: Randomized algorithms for the loop cutset problem. JAIR 12, 219–234 (2000)MathSciNetMATHGoogle Scholar
  3. 3.
    Bodlaender, H.L., Fomin, F.V., Lokshtanov, D., Penninkx, E., Saurabh, S., Thilikos, D.M.: (Meta) kernelization. In: FOCS 2009, pp. 629–638 (2009)Google Scholar
  4. 4.
    Cao, Y.: Unit interval editing is fixed-parameter tractable. In: ICALP 2015, volume 9134 of LNCS, pp 306–317. Springer (2015)Google Scholar
  5. 5.
    Cao, Y., Marx, D.: Interval deletion is fixed-parameter tractable. ACM Trans. Algorithms 11(3), 21:1–21:35 (2015)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, Dániel, Pilipczuk, Marcin, Pilipczuk, Michal, Saurabh, Saket: Parameterized Algorithms. Springer, Berlin (2015)CrossRefMATHGoogle Scholar
  7. 7.
    Diestel, R.: Graph Theory, Volume 173, Graduate Texts in Mathematics, 4th edn. Springer, Berlin (2012)Google Scholar
  8. 8.
    Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, Berlin (2013)CrossRefMATHGoogle Scholar
  9. 9.
    Fiorini, S., Joret, G., Pietropaoli, U.: Hitting diamonds and growing cacti. In: IPCO 2010, volume 9682 of LNCS, pp. 191–204 (2010)Google Scholar
  10. 10.
    Fomin, F.V., Lokshtanov, D., Misra, N., Philip, G., Saurabh, S.: Hitting forbidden minors: approximation and kernelization. SIAM J. Discrete Math. 30(1), 383–410 (2016)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Fomin, F.V., Lokshtanov, D., Misra, N., Saurabh, S.: Planar F-deletion: approximation, kernelization and optimal FPT algorithms. In: FOCS 2012, pp. 470–479 (2012)Google Scholar
  12. 12.
    Fomin, F.V., Villanger, Y.: Subexponential parameterized algorithm for minimum fill-in. SIAM J. Comput. 42(6), 2197–2216 (2013)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Giannopoulou, A.C., Jansen, B.M.P., Lokshtanov, D., Saurabh, S.: Uniform kernelization complexity of hitting forbidden minors. In: ICALP 2015, volume 9134 of LNCS, pp. 629–641. Springer (2015)Google Scholar
  14. 14.
    Hopcroft, J., Tarjan, R.: Algorithm 447: efficient algorithms for graph manipulation. Commun. ACM 16(6), 372–378 (1973)CrossRefGoogle Scholar
  15. 15.
    Joret, G., Paul, C., Sau, I., Saurabh, S., Thomassé, Stéphan: Hitting and harvesting pumpkins. SIAM J. Discrete Math. 28(3), 1363–1390 (2014)MathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    Kim, E.J., Langer, A., Paul, C., Reidl, F., Rossmanith, P., Sau, I., Sikdar, S.: Linear kernels and single-exponential algorithms via protrusion decompositions. In: ICALP 2013, volume 7965 of LNCS, pp. 613–624. Springer (2013)Google Scholar
  17. 17.
    Kim, E.J., Paul, C., Philip, G.: A single-exponential FPT algorithm for the \({K}_{\text{4 }}\)-minor cover problem. J. Comput. Syst. Sci. 81(1), 186–207 (2015)MathSciNetCrossRefMATHGoogle Scholar
  18. 18.
    LaPaugh, A.S., Papadimitriou, C.H.: The even-path problem for graphs and digraphs. Networks 14(4), 507–513 (1984)MathSciNetCrossRefMATHGoogle Scholar
  19. 19.
    Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is NP-complete. J. Comput. Syst. Sci. 20(2), 219–230 (1980)MathSciNetCrossRefMATHGoogle Scholar
  20. 20.
    Misra, P., Raman, V., Ramanujan, M.S., Saurabh, S.: Parameterized algorithms for even cycle transversal. In: WG 2012, volume 7551 of LNCS, pp. 172–183 (2012)Google Scholar
  21. 21.
    Thomassen, C.: On the presence of disjoint subgraphs of a specified type. J. Graph Theory 12(1), 101–111 (1988)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2017

Authors and Affiliations

  • Sudeshna Kolay
    • 1
  • Daniel Lokshtanov
    • 2
  • Fahad Panolan
    • 2
  • Saket Saurabh
    • 1
  1. 1.The Institute of Mathematical SciencesHBNITaramani, ChennaiIndia
  2. 2.Department of InformaticsUniversity of BergenBergenNorway

Personalised recommendations