Advertisement

Parameterized Complexity of Fair Feedback Vertex Set Problem

  • Lawqueen KaneshEmail author
  • Soumen Maity
  • Komal MulukEmail author
  • Saket Saurabh
Conference paper
  • 78 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 12159)

Abstract

Given a graph \(G=(V,E)\), a subset \(S\subseteq V(G)\) is said to be a feedback vertex set of G if \(G-S\) is a forest. In the Feedback Vertex Set (FVS) problem, we are given an undirected graph G, and a positive integer k, the question is whether there exists a feedback vertex set of size at most k. This problem is extremely well studied in the realm of parameterized complexity. In this paper, we study three variants of the FVS problem: Unrestricted Fair FVS, Restricted Fair FVS, and Relax Fair FVS. In Unrestricted Fair FVS problem, we are given a graph G and a positive integer \(\ell \), the question is does there exists a feedback vertex set \(S\subseteq V(G)\) (of any size) such that for every vertex \(v\in V(G)\), v has at most \(\ell \) neighbours in S. First, we study Unrestricted Fair FVS from different parameterizations such as treewidth, treedepth and neighbourhood diversity and obtain several results (both tractability and intractability). Next, we study Restricted Fair FVS problem, where we are also given an integer k in the input and we demand the size of S to be at most k. This problem is trivially NP-complete; we show that Restricted Fair FVS problem when parameterized by the solution size k and the maximum degree \(\varDelta \) of the graph G, admits a kernel of size \(\mathcal {O}((k+\varDelta )^2)\). Finally, we study Relax Fair FVS problem, where we want that the size of S is at most k and for every vertex outside S, that is, for all \(v\in V(G)\setminus S\), v has at most \(\ell \) neighbours in S. We give an FPT algorithm for Relax Fair FVS problem running in time \(c^k n^{\mathcal {O}(1)}\), for a fixed constant c.

Keywords

Feedback vertex set Parameterized complexity FPT W[1]-hard 

References

  1. 1.
    Bertelè, U., Brioschi, F.: Nonserial Dynamic Programming. Academic Press Inc., New York (1972)zbMATHGoogle Scholar
  2. 2.
    Bodlaender, H.L.: On disjoint cycles. Int. J. Found. Comput. Sci. 5, 59–68 (1994)CrossRefGoogle Scholar
  3. 3.
    Cao, Y., Chen, J., Liu, Y.: On feedback vertex set: new measure and new structures. Algorithmica 73(1), 63–86 (2015)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Cygan, M., et al.: Lower bounds for kernelization. Parameterized Algorithms, pp. 523–555. Springer, Cham (2015).  https://doi.org/10.1007/978-3-319-21275-3_15CrossRefGoogle Scholar
  5. 5.
    Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness I: basic results. SIAM J. Comput. 24, 873–921 (1995)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Iwata, Y., Kobayashi, Y.: Improved analysis of highest-degree branching for feedback vertex set. In: 14th International Symposium on Parameterized and Exact Computation, IPEC 2019, 11–13 September, 2019, Munich, Germany, LIPIcs, vol. 148, pp. 22:1–22:11 (2019)Google Scholar
  7. 7.
    Jacob, A., Raman, V., Sahlot, V.: Deconstructing parameterized hardness of fair vertex deletion problems. In: Du, D.-Z., Duan, Z., Tian, C. (eds.) COCOON 2019. LNCS, vol. 11653, pp. 325–337. Springer, Cham (2019).  https://doi.org/10.1007/978-3-030-26176-4_27CrossRefGoogle Scholar
  8. 8.
    Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85–103. Plenum Press (1972)Google Scholar
  9. 9.
    Knop, D., Masarík, T., Toufar, T.: Parameterized complexity of fair vertex evaluation problems. In: 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, 26–30 August 2019, Aachen, Germany, LIPIcs, vol. 138, pp. 33:1–33:16 (2019)Google Scholar
  10. 10.
    Lampis, M.: Algorithmic meta-theorems for restrictions of treewidth. Algorithmica 64(1), 19–37 (2012)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Li, J., Nederlof, J.: Detecting feedback vertex sets of size \(k\) in \(O^{*}(2.7^k)\) time. In: Proceedings of the Thirty First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 971–981 (2020)Google Scholar
  12. 12.
    Lin, L., Sahni, S.: Fair edge deletion problems. IEEE Trans. Comput. 38(5), 756–761 (1989)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Masařík, T., Toufar, T.: Parameterized complexity of fair deletion problems. Discrete Appl. Math. 278, 51–61 (2020) Google Scholar
  14. 14.
    Silberschatz, A., Galvin, P.B., Gagne, G.: Operating System Concepts. Wiley Publishing, New York (2008)zbMATHGoogle Scholar
  15. 15.
    West, D.B.: Introduction to Graph Theory. Prentice Hall, Upper Saddle River (2000)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Indian Institute of Science Education and ResearchPuneIndia
  2. 2.The Institute of Mathematical SciencesChennaiIndia
  3. 3.University of BergenBergenNorway

Personalised recommendations