On the Parameterized Complexity of Simultaneous Deletion Problems

Authors Akanksha Agrawal, R. Krithika, Daniel Lokshtanov, Amer E. Mouawad, M. S. Ramanujan



PDF
Thumbnail PDF

File

LIPIcs.FSTTCS.2017.9.pdf
  • Filesize: 0.61 MB
  • 14 pages

Document Identifiers

Author Details

Akanksha Agrawal
R. Krithika
Daniel Lokshtanov
Amer E. Mouawad
M. S. Ramanujan

Cite AsGet BibTex

Akanksha Agrawal, R. Krithika, Daniel Lokshtanov, Amer E. Mouawad, and M. S. Ramanujan. On the Parameterized Complexity of Simultaneous Deletion Problems. In 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 93, pp. 9:1-9:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/LIPIcs.FSTTCS.2017.9

Abstract

For a family of graphs F, an n-vertex graph G, and a positive integer k, the F-Deletion problem asks whether we can delete at most k vertices from G to obtain a graph in F. F-Deletion generalizes many classical graph problems such as Vertex Cover, Feedback Vertex Set, and Odd Cycle Transversal. A (multi) graph G = (V, \cup_{i=1}^{\alpha} E_{i}), where the edge set of G is partitioned into \alpha color classes, is called an \alpha-edge-colored graph. A natural extension of the F-Deletion problem to edge-colored graphs is the Simultaneous (F_1, \ldots, F_\alpha)-Deletion problem. In the latter problem, we are given an \alpha-edge-colored graph G and the goal is to find a set S of at most k vertices such that each graph G_i - S, where G_i = (V, E_i) and 1 \leq i \leq \alpha, is in F_i. Recently, a subset of the authors considered the aforementioned problem with F_1 = \ldots = F_\alpha being the family of all forests. They showed that the problem is fixed-parameter tractable when parameterized by k and \alpha, and can be solved in O(2^{O(\alpha k)}n^{O(1)}) time. In this work, we initiate the investigation of the complexity of Simultaneous (F_1, \ldots, F_\alpha)-Deletion with different families of graphs. In the process, we obtain a complete characterization of the parameterized complexity of this problem when one or more of the F_i's is the class of bipartite graphs and the rest (if any) are forests. We show that if F_1 is the family of all bipartite graphs and each of F_2 = F_3 = \ldots = F_\alpha is the family of all forests then the problem is fixed-parameter tractable parameterized by k and \alpha. However, even when F_1 and F_2 are both the family of all bipartite graphs, then the Simultaneous (F_1, F_2)-Deletion} problem itself is already W[1]-hard.
Keywords
  • parameterized complexity
  • feedback vertex set
  • odd cycle transversal
  • edge-colored graphs
  • simultaneous deletion

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad, and Saket Saurabh. Simultaneous feedback vertex set: A parameterized perspective. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS), pages 7:1-7:15, 2016. Google Scholar
  2. Leizhen Cai and Junjie Ye. Dual connectedness of edge-bicolored graphs and beyond. In 39th International Symposium on Mathematical Foundations of Computer Science, pages 141-152, 2014. Google Scholar
  3. Yixin Cao and Dániel Marx. Interval deletion is fixed-parameter tractable. ACM Transactions on Algorithms, 11(3):21:1-21:35, 2015. Google Scholar
  4. Yixin Cao and Dániel Marx. Chordal editing is fixed-parameter tractable. Algorithmica, 75(1):118-137, 2016. Google Scholar
  5. Jianer Chen, Fedor V. Fomin, Yang Liu, Songjian Lu, and Yngve Villanger. Improved Algorithms for Feedback Vertex Set Problems. Journal of Computer and System Sciences, 74(7):1188-1198, 2008. Google Scholar
  6. Jianer Chen, Iyad A. Kanj, and Ge Xia. Improved Upper Bounds for Vertex Cover. Theoretical Computer Science, 411(40-42):3736-3756, 2010. Google Scholar
  7. Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh. Parameterized Algorithms. Springer, 2015. Google Scholar
  8. Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, and Jakub Onufry Wojtaszczyk. Subset Feedback Vertex Set Is Fixed-Parameter Tractable. SIAM Journal of Discrete Mathematics, 27(1):290-309, 2013. Google Scholar
  9. Reinhard Diestel. Graph Theory. Springer-Verlag, Heidelberg, 4th edition, 2010. Google Scholar
  10. Rod G. Downey and Michael R. Fellows. Parameterized complexity. Springer-Verlag, 1997. Google Scholar
  11. Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, and Saket Saurabh. Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms. In 53rd Annual IEEE Symposium on Foundations of Computer Science, (FOCS), pages 470-479, 2012. Google Scholar
  12. Robert Ganian, M. S. Ramanujan, and Stefan Szeider. Discovering archipelagos of tractability for constraint satisfaction and counting. ACM Transactions on Algorithms, 13(2):29:1-29:32, 2017. Google Scholar
  13. Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, and Sebastian Wernicke. Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. Journal of Computer and System Sciences, 72(8):1386-1396, 2006. Google Scholar
  14. Yoichi Iwata, Keigo Oka, and Yuichi Yoshida. Linear-time FPT algorithms via network flow. In 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1749-1761, 2014. Google Scholar
  15. Bart M. P. Jansen, Daniel Lokshtanov, and Saket Saurabh. A near-optimal planarization algorithm. In 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1802-1811, 2014. Google Scholar
  16. Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, and Somnath Sikdar. Linear kernels and single-exponential algorithms via protrusion decompositions. ACM Transactions on Algorithms, 12(2):21:1-21:41, 2016. Google Scholar
  17. Tomasz Kociumaka and Marcin Pilipczuk. Faster deterministic Feedback Vertex Set. Information Processing Letters, 114(10):556-560, 2014. Google Scholar
  18. Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, and Saket Saurabh. Faster Parameterized Algorithms Using Linear Programming. ACM Transactions on Algorithms, 11(2):15:1-15:31, 2014. Google Scholar
  19. Daniel Lokshtanov and M. S. Ramanujan. Parameterized Tractability of Multiway Cut with Parity Constraints. In 39th International Colloquium on Automata, Languages, and Programming (ICALP), pages 750-761, 2012. Google Scholar
  20. Daniel Lokshtanov, M. S. Ramanujan, and Saket Saurabh. A linear time parameterized algorithm for directed feedback vertex set. ArXiv e-prints, 2016. URL: http://arxiv.org/abs/1609.04347.
  21. Dániel Marx, Barry O'Sullivan, and Igor Razgon. Finding small separators in linear time via treewidth reduction. ACM Transactions on Algorithms, 9(4):30:1-30:35, 2013. Google Scholar
  22. M. S. Ramanujan and Saket Saurabh. Linear time parameterized algorithms via skew-symmetric multicuts. In 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1739-1748, 2014. Google Scholar
  23. Bruce Reed, Kaleigh Smith, and Adrian Vetta. Finding odd cycle transversals. Operations Research Letters, 32(4):299-301, 2004. Google Scholar
  24. Junjie Ye. A note on finding dual feedback vertex set. ArXiv e-prints, 2015. URL: http://arxiv.org/abs/1510.00773.