Abstract
A graph operation that contracts edges is one of the fundamental operations in the theory of graph minors. Parameterized Complexity of editing to a family of graphs by contracting k edges has recently gained substantial scientific attention, and several new results have been obtained. Some important families of graphs, namely, the subfamilies of chordal graphs, in the context of edge contractions, have proven to be significantly difficult than one might expect. In this article, we study the F-Contraction problem, where F is a subfamily of chordal graphs, in the realm of parameterized approximation. Formally, given a graph G and an integer k, F-Contraction asks whether there exists X ⊆ E(G) such that G/X ∈ F and |X| ≤ k. Here, G/X is the graph obtained from G by contracting edges in X. We obtain the following results for the F-Contraction problem:
• | Clique Contraction is known to be | ||||
• | Split Contraction is known to be | ||||
• | Chordal Contraction is known to be | ||||
- Akanksha Agarwal, Saket Saurabh, and Prafullkumar Tale. 2019. On the parameterized complexity of contraction to generalization of trees. Theor. Comput. Syst. 63, 3 (2019), 587–614. Google Scholar
Digital Library
- Akanksha Agrawal, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi. 2017. Split contraction: The untold story. In STACS. 5:1–5:14.Google Scholar
- Takao Asano and Tomio Hirata. 1983. Edge-contraction problems. J. Comput. System Sci. 26, 2 (1983), 197–208.Google Scholar
Cross Ref
- Reuven Bar-Yehuda and Shimon Even. 1981. A linear-time approximation algorithm for the weighted vertex cover problem. J. Algor. 2, 2 (1981), 198–203.Google Scholar
Cross Ref
- Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, and Michal Pilipczuk. 2014. A subexponential parameterized algorithm for proper interval completion. SIAM Journal on Discrete Mathematics.Google Scholar
- Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, and Michal Pilipczuk. 2016. A subexponential parameterized algorithm for interval completion. In SODA. 1116–1131. Google Scholar
Digital Library
- Leizhen Cai. 1996. Fixed-parameter tractability of graph modification problems for hereditary properties. Inform. Process. Lett. 58, 4 (1996), 171–176. Google Scholar
Digital Library
- Leizhen Cai and Chengwei Guo. 2013. Contracting Few edges to remove forbidden induced subgraphs. In IPEC. 97–109.Google Scholar
- Yixin Cao. 2015. Unit interval editing is fixed-parameter tractable. In ICALP. 306–317.Google Scholar
- Yixin Cao. 2016. Linear recognition of almost interval graphs. In SODA. 1096–1115. Google Scholar
Digital Library
- Yixin Cao and Dániel Marx. 2014. Chordal editing is fixed-parameter tractable. In STACS. 214–225.Google Scholar
- Yixin Cao and Dániel Marx. 2015. Interval deletion is fixed-parameter tractable. ACM Trans. Algor. 11, 3 (2015), 21. Google Scholar
Digital Library
- Parinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai, and Luca Trevisan. 2017. From Gap-ETH to FPT-Inapproximability: Clique, dominating set, and more. In FOCS. 743–754.Google Scholar
- Parinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai, and Luca Trevisan. 2017. From Gap-ETH to FPT-Inapproximability: Clique, dominating set, and more. CoRR abs/1708.04218 (2017).Google Scholar
- Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh. 2015. Parameterized Algorithms. Springer. Google Scholar
Digital Library
- Reinhard Diestel. 2012. Graph Theory, 4th edition. (Graduate Texts in Mathematics, Vol. 173.). Springer.Google Scholar
- Rod G. Downey and Michael R. Fellows. 2013. Fundamentals of Parameterized complexity. Springer-Verlag. Google Scholar
Digital Library
- Pål Grønås Drange, Markus Sortland Dregi, Daniel Lokshtanov, and Blair D. Sullivan. 2015. On the threshold of intractability. In Algorithms-ESA 2015. Springer, 411–423.Google Scholar
- Pål Grønås Drange, Fedor V. Fomin, Michał Pilipczuk, and Yngve Villanger. 2014. Exploring subexponential parameterized complexity of completion problems. In STACS. 288–299.Google Scholar
- Pål Grønås Drange and Michal Pilipczuk. 2018. A polynomial kernel for trivially perfect editing. Algorithmica 80 (2018), 3481–3524. Google Scholar
Digital Library
- Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomas Toufar, and Pavel Veselý. 2018. Parameterized approximation schemes for Steiner trees with small number of Steiner vertices. In STACS. 26:1–26:15.Google Scholar
- Eduard Eiben, Danny Hermelin, and M. S. Ramanujan. 2017. Lossy kernels for hitting subgraphs. In MFCS. 67:1–67:14.Google Scholar
- Eduard Eiben, Mithilesh Kumar, Amer E. Mouawad, Fahad Panolan, and Sebastian Siebertz. 2019. Lossy kernels for connected dominating set on sparse graphs. SIAM J. Discr. Math. 33, 3 (2019), 1743–1771.Google Scholar
Cross Ref
- Jörg Flum and Martin Grohe. 2006. Parameterized Complexity Theory. Springer. Google Scholar
Digital Library
- Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk, and Yngve Villanger. 2014. Tight bounds for parameterized complexity of cluster editing with a small number of clusters. J. Comput. System Sci. 80, 7 (2014), 1430–1447.Google Scholar
Cross Ref
- Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi. 2019. Kernelization: Theory of Parameterized Preprocessing. Cambridge University Press.Google Scholar
- Fedor V. Fomin and Yngve Villanger. 2013. Subexponential parameterized algorithm for minimum fill-in. SIAM J. Comput. 42, 6 (2013), 2197–2216.Google Scholar
Cross Ref
- Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Ashutosh Rai, and M. S. Ramanujan. 2015. Faster parameterized algorithms for deletion to split graphs. Algorithmica 71, 4 (2015), 989–1006. Google Scholar
Digital Library
- Petr A. Golovach, Pim van’t Hof, and Daniël Paulusma. 2013. Obtaining planarity by contracting few edges. Theoret. Comput.Sci. 476 (2013), 38–46. Google Scholar
Digital Library
- Martin Charles Golumbic. 2004. Algorithmic Graph Theory and Perfect Graphs. Vol. 57. Elsevier.Google Scholar
Digital Library
- Sylvain Guillemot and Dániel Marx. 2013. A faster FPT algorithm for bipartite contraction. Inform. Process. Lett. 113, 22–24 (2013), 906–912. Google Scholar
Digital Library
- Chengwei Guo and Leizhen Cai. 2015. Obtaining split graphs by edge contraction. Theoret. Comput. Sci. 607 (2015), 60–67. Google Scholar
Digital Library
- Pinar Heggernes, Pim van ’t Hof, Benjamin Lévêque, Daniel Lokshtanov, and Christophe Paul. 2014. Contracting graphs to paths and trees. Algorithmica 68, 1 (2014), 109–132.Google Scholar
Cross Ref
- Pinar Heggernes, Pim van ’t Hof, Daniel Lokshtanov, and Christophe Paul. 2013. Obtaining a bipartite graph by contracting few edges. SIAM J. Discr. Math. 27, 4 (2013), 2143–2156.Google Scholar
Cross Ref
- Karthik C. S., Bundit Laekhanukit, and Pasin Manurangsi. 2018. On the parameterized complexity of approximating dominating set. In STOC. ACM, 1283–1296. Google Scholar
Digital Library
- R. Krithika, Diptapriyo Majumdar, and Venkatesh Raman. 2018. Revisiting connected vertex cover: FPT algorithms and lossy kernels. Theor. Comput. Syst. 62, 8 (2018), 1690–1714. Google Scholar
Digital Library
- R. Krithika, Pranabendu Misra, Ashutosh Rai, and Prafullkumar Tale. 2016. Lossy kernels for graph contraction problems. In FSTTCS. 23:1–23:14.Google Scholar
- Daniel Lokshtanov, Neeldhara Misra, and Saket Saurabh. 2013. On the hardness of eliminating small induced subgraphs by contracting edges. In IPEC. 243–254.Google Scholar
- Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, and Saket Saurabh. 2020. A -factor approximation algorithm for split vertex deletion. In 47th International Colloquium on Automata, Languages and Programming, ICALP 2020(LIPIcs, Vol. 168). 80:1–80:16. https://doi.org/10.4230/LIPIcs.ICALP.2020.80Google Scholar
- Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, and Saket Saurabh. 2017. Lossy kernelization. In STOC. 224–237. Google Scholar
Digital Library
- Pasin Manurangsi. 2019. A note on max k-vertex cover: Faster FPT-AS, smaller approximate kernel and improved approximation. In SOSA.Google Scholar
- Moni Naor, Leonard J. Schulman, and Aravind Srinivasan. 1995. Splitters and near-optimal derandomization. In FOCS. 182–191. Google Scholar
Digital Library
- Rolf Niedermeier. 2006. Invitation to Fixed-parameter Algorithms. Oxford University Press.Google Scholar
- M. S. Ramanujan. 2019. An approximate kernel for connected feedback vertex set. In 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany(LIPIcs, Vol. 144). 77:1–77:14.Google Scholar
- Sebastian Siebertz. 2017. Lossy kernels for connected distance- domination on nowhere dense graph classes. arXiv preprint arXiv:1707.09819 (2017).Google Scholar
- René van Bevern, Till Fluschnik, and Oxana Yu Tsidulko. 2018. On -approximate problem kernels for the Rural Postman Problem. arXiv preprint arXiv:1812.10131 (2018).Google Scholar
- Toshimasa Watanabe, Tadashi Ae, and Akira Nakamura. 1981. On the removal of forbidden graphs by edge-deletion or by edge-contraction. Discr. Appl. Math. 3, 2 (1981), 151–153.Google Scholar
Cross Ref
- Toshimasa Watanabe, Tadashi Ae, and Akira Nakamura. 1983. On the NP-hardness of edge-deletion and-contraction problems. Discr. Appl. Math. 6, 1 (1983), 63–78.Google Scholar
Cross Ref
Index Terms
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs
Recommendations
Parameterized coloring problems on chordal graphs
Parameterized and exact computationIn the precoloring extension problem (PREXT) a graph is given with some of the vertices having preassigned colors and it has to be decided whether this coloring can be extended to a proper coloring of the graph with the given number of colors. Two ...
On the Parameterized Complexity of Maximum Degree Contraction Problem
AbstractIn the Maximum Degree Contraction problem, the input is a graph G on n vertices, and integers k, d, and the objective is to check whether G can be transformed into a graph of maximum degree at most d, using at most k edge contractions. A simple ...
On the Parameterized Complexity of Contraction to Generalization of Trees
For a family of graphs F$\mathcal {F}$, the F$\mathcal {F}$-Contraction problem takes as an input a graph G and an integer k, and the goal is to decide if there exists S ⊆ E(G) of size at most k such that G/S belongs to F$\mathcal {F}$. Here, G/S is the ...






Comments