Abstract
The Pathwidth One Vertex Deletion (POVD) problem asks whether, given an undirected graph G and an integer k, one can delete at most k vertices from G so that the remaining graph has pathwidth at most 1. The question can be considered as a natural variation of the extensively studied Feedback Vertex Set (FVS) problem, where the deletion of at most k vertices has to result in the remaining graph having treewidth at most 1 (i.e., being a forest). Recently Philip et al. (WG, Lecture Notes in Computer Science, vol. 6410, pp. 196–207, 2010) initiated the study of the parameterized complexity of POVD, showing a quartic kernel and an algorithm which runs in time 7k n O(1). In this article we improve these results by showing a quadratic kernel and an algorithm with time complexity 4.65k n O(1), thus obtaining almost tight kernelization bounds when compared to the general result of Dell and van Melkebeek (STOC, pp. 251–260, ACM, New York, 2010). Techniques used in the kernelization are based on the quadratic kernel for FVS, due to Thomassé (ACM Trans. Algorithms 6(2), 2010).
Article PDF
Similar content being viewed by others
References
Àlvarez, C., Serna, M.J.: The proper interval colored graph problem for caterpillar trees (extended abstract). Electron. Notes Discrete Math. 17, 23–28 (2004)
Arnborg, S., Proskurowski, A., Seese, D.: Monadic second order logic, tree automata and forbidden minors. In: Börger, E., Büning, H.K., Richter, M.M., Schönfeld, W. (eds.) CSL. Lecture Notes in Computer Science, vol. 533, pp. 1–16. Springer, Berlin (1990)
Assmann, S.F., Peck, G.W., Syslo, M.M., Zak, J.: The bandwidth of caterpillars with hairs of length 1 and 2. SIAM J. Algebr. Discrete Methods 2(4), 387–393 (1981)
Cao, Y., Chen, J., Liu, Y.: On feedback vertex set new measure and new structures. In: Kaplan, H. (ed.) SWAT. Lecture Notes in Computer Science, vol. 6139, pp. 93–104. Springer, Berlin (2010)
Cygan, M., Nederlof, J., Pilipczuk, M., Pilipczuk, M., van Rooij, J.M.M., Wojtaszczyk, J.O.: Solving connectivity problems parameterized by treewidth in single exponential time. In: FOCS (to appear), see also CoRR. arXiv:1103.0534 [cs.Ds] (2011)
Dell, H., van Melkebeek, D.: Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. In: Schulman, L.J. (ed.) STOC, pp. 251–260. ACM, New York (2010)
Diestel, R.: Graph Theory. Graduate Texts in Mathematics. Springer, Berlin (2006)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Berlin (1999)
Dujmovic, V., Fellows, M.R., Hallett, M.T., Kitching, M., Liotta, G., McCartin, C., Nishimura, N., Ragde, P., Rosamond, F.A., Suderman, M., Whitesides, S., Wood, D.R.: A fixed-parameter approach to 2-layer planarization. Algorithmica 45(2), 159–182 (2006)
Fernau, H.: Two-layer planarization: improving on parameterized algorithmics. In: Vojtás, P., Bieliková, M., Charron-Bost, B., Sýkora, O. (eds.) SOFSEM. Lecture Notes in Computer Science, vol. 3381, pp. 137–146. Springer, Berlin (2005)
Flum, J., Grohe, M.: Parameterized Complexity Theory, 1st edn. Texts in Theoretical Computer Science. An EATCS Series. Springer, Secaucus (2006)
Lin, M., Lin, Z., Xu, J.: Graph bandwidth of weighted caterpillars. Theor. Comput. Sci. 363(3), 266–277 (2006)
Lovász, L., Plummer, M.D.: Matching Theory. Annals of Discrete Mathematics. North-Holland, Amsterdam (1986)
Mucha, M., Sankowski, P.: Maximum matchings via gaussian elimination. In: FOCS, pp. 248–255. IEEE Comp. Soc., Los Alamitos (2004)
Niedermeier, R.: Invitation to Fixed Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications. Oxford University Press, London (2006)
Ore, O.: Graphs and matching theorems. Duke Math. J. 22(4), 625–639 (1955)
Papadimitriou, C.H.: The NP-completeness of the bandwidth minimization problem. Computing 16(3), 263–270 (1976)
Philip, G., Raman, V., Villanger, Y.: A quartic kernel for pathwidth-one vertex deletion. In: Thilikos, D.M. (ed.) WG. Lecture Notes in Computer Science, vol. 6410, pp. 196–207 (2010)
Robertson, N., Seymour, P.D.: Graph minors. I. Excluding a forest. J. Comb. Theory, Ser. B 35(1), 39–61 (1983)
Robertson, N., Seymour, P.D.: Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms 7(3), 309–322 (1986)
Suderman, M.: Layered graph drawing. Ph.D. thesis, School of Computer Science, McGill University Montreál (2005)
Thomassé, S.: A 4k 2 kernel for feedback vertex set. ACM Transactions on Algorithms 6(2), 32:1–32:8 (2010)
Uhlmann, J., Weller, M.: Two-layer planarization parameterized by feedback edge set. In: Kratochvíl, J., Li, A., Fiala, J., Kolman, P. (eds.) TAMC. Lecture Notes in Computer Science, vol. 6108, pp. 431–442. Springer, Berlin (2010)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Cygan, M., Pilipczuk, M., Pilipczuk, M. et al. An Improved FPT Algorithm and a Quadratic Kernel for Pathwidth One Vertex Deletion. Algorithmica 64, 170–188 (2012). https://doi.org/10.1007/s00453-011-9578-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-011-9578-2