Skip to main content
SpringerLink
Log in
Book cover

International Conference on Theory and Applications of Models of Computation

TAMC 2017: Theory and Applications of Models of Computation pp 654–668Cite as

Kernelization and Parameterized Algorithms for 3-Path Vertex Cover

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10185))

Abstract

A 3-path vertex cover in a graph is a vertex subset C such that every path of three vertices contains at least one vertex from C. The parameterized 3-path vertex cover problem asks whether a graph has a 3-path vertex cover of size at most k. In this paper, we give a kernel of 5 k vertices and an \(O^*(1.7485^k)\)-time algorithm for this problem, both new results improve previous known bounds.

This work is supported by National Natural Science Foundation of China, under the grant 61370071, and the Fundamental Research Funds for the Central Universities, under the grant ZYGX2015J057.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Abu-Khzam, F.N., Collins, R.L., Fellows, M.R., Langston, M.A.: Kernelization algorithms for the vertex cover problem: theory and experiments. In: ALENEX/ANALC, pp. 62–69 (2004)

    Google Scholar 

  2. Alekseev, V.E., Boliac, R., Korobitsyn, D.V., Lozin, V.V.: NP-hard graph problems and boundary classes of graphs. Theor. Comput. Sci. 389(1–2), 219–236 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  3. Asdre, K., Nikolopoulos, S.D., Papadopoulos, C.: An optimal parallel solution for the path cover problem on \(P_4\)-sparse graphs. J. Parallel Distrib. Comput. 67(1), 63–76 (2007)

    Article  MATH  Google Scholar 

  4. Boliac, R., Cameron, K., Lozin, V.V.: On computing the dissociation number and the induced matching number of bipartite graphs. Ars Combin. 72, 241–253 (2004)

    MathSciNet  MATH  Google Scholar 

  5. Brešar, B., Jakovac, M., Katrenič, J., Semanišin, G., Taranenko, A.: On the vertex \(k\)-path cover. Discrete Appl. Math. 161(13–14), 1943–1949 (2013)

    MathSciNet  MATH  Google Scholar 

  6. Brešar, B., Kardoš, F., Katrenič, J., Semanišin, G.: Minimum \(k\)-path vertex cover. Discrete Appl. Math. 159(12), 1189–1195 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  7. Cameron, K., Hell, P.: Independent packings in structured graphs. Math. Program. 105(2–3), 201–213 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  8. Chang, M.-S., Chen, L.-H., Hung, L.-J., Liu, Y.-Z., Rossmanith, P., Sikdar, S.: An \(O^*(1.4658^n)\)-time exact algorithm for the maximum bounded-degree-1 set problem. In: The 31st Workshop on Combinatorial Mathematics and Computation Theory, pp. 9–18 (2014)

    Google Scholar 

  9. Chang, M.-S., Chen, L.-H., Huang, L.-J.: A \(5k\) kernel for \(P_2\)-packing in net-free graphs. In: International Computer Science and Engineering Conference, pp. 12–17. IEEE (2014)

    Google Scholar 

  10. Chen, J., Fernau, H., Shaw, P., Wang, J., Yang, Z.: Kernels for packing and covering problems. In: Snoeyink, J., Lu, P., Su, K., Wang, L. (eds.) AAIM/FAW -2012. LNCS, vol. 7285, pp. 199–211. Springer, Heidelberg (2012). doi:10.1007/978-3-642-29700-7_19

    Chapter  Google Scholar 

  11. Fellows, M.R., Guo, J., Moser, H., Niedermeier, R.: A generalization of Nemhauser and Trotter’s local optimization theorem. JCSS 77(6), 1141–1158 (2011)

    MathSciNet  MATH  Google Scholar 

  12. Fermau, H., Raible, D.: A parameterized perspective on packing paths of length two. J. Comb. Optim. 18(4), 319–341 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  13. Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. Springer, Berlin (2010)

    Book  MATH  Google Scholar 

  14. Göring, F., Harant, J., Rautenbach, D., Schiermeyer, I.: On F-independence in graphs. Discussiones Math. Graph Theor. 29(2), 377–383 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  15. Hung, R.-W., Chang, M.-S.: Finding a minimum path cover of a distance-hereditary graph in polynomial time. Discrete Appl. Math. 155(17), 2242–2256 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  16. Kardoš, F., Katrenič, J.: On computing the minimum 3-path vertex cover and dissociation number of graphs. Theoret. Comput. Sci. 412(50), 7009–7017 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  17. Katrenič, J.: A faster FPT algorithm for 3-path vertex cover. Inf. Process. Lett. 116(4), 273–278 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  18. Lozin, V.V., Rautenbach, D.: Some results on graphs without long induced paths. Inf. Process. Lett. 88(4), 167–171 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  19. Orlovich, Y., Dolgui, A., Finke, G., Gordon, V., Werner, F.: The complexity of dissociation set problems in graphs. Disc. Appl. Math. 159(13), 1352–1366 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  20. Papadimitriou, C.H., Yannakakis, M.: The complexity of restricted spanning tree problems. J. ACM 29(2), 285–309 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  21. Prieto, E., Sloper, C.: Looking at the stars. Theor. Comp. Sci. 351(3), 437–445 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  22. Tu, J.: A fixed-parameter algorithm for the vertex cover P3 problem. Inf. Process. Lett. 115(2), 96–99 (2015)

    Article  MATH  Google Scholar 

  23. Wang, J., Ning, D., Feng, Q., Chen, J.: An improved kernelization for \(P_2\)-packing. Inf. Process. Lett. 110(5), 188–192 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  24. Wu, B.Y.: A measure and conquer approach for the parameterized bounded degree-one vertex deletion. In: Xu, D., Du, D., Du, D. (eds.) COCOON 2015. LNCS, vol. 9198, pp. 469–480. Springer, Heidelberg (2015). doi:10.1007/978-3-319-21398-9_37

    Chapter  Google Scholar 

  25. Xiao, M.: On a generalization of Nemhauser and Trotter’s local optimization theorem. J. Comput. Syst. Sci. 84, 97–106 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  26. Xiao, M.: A parameterized algorithm for bounded-degree vertex deletion. In: Dinh, T.N., Thai, M.T. (eds.) COCOON 2016. LNCS, vol. 9797, pp. 79–91. Springer, Heidelberg (2016). doi:10.1007/978-3-319-42634-1_7

    Chapter  Google Scholar 

  27. Xiao, M., Kou, S.: Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems. Theoret. Comput. Sci. 657, 86–97 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  28. Yannakakis, M.: Node-deletion problems on bipartite graphs. SIAM J. Comput. 10(2), 310–327 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  29. Chang, M-S., Chen, L-H., Hung, L-J., Rossmanith, p., Su, P-C.: Fixed-parameter algorithms for vertex cover P3. Discrete Optim. 19, 12–22 (2016)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, 611731, China

    Mingyu Xiao & Shaowei Kou

Authors
  1. Mingyu Xiao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shaowei Kou
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mingyu Xiao .

Editor information

Editors and Affiliations

  1. Anna University, Chennai, India

    T.V. Gopal

  2. Universität Bern , Bern, Switzerland

    Gerhard Jäger

  3. Universität Bern , Bern, Switzerland

    Silvia Steila

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Xiao, M., Kou, S. (2017). Kernelization and Parameterized Algorithms for 3-Path Vertex Cover. In: Gopal, T., Jäger , G., Steila, S. (eds) Theory and Applications of Models of Computation. TAMC 2017. Lecture Notes in Computer Science(), vol 10185. Springer, Cham. https://doi.org/10.1007/978-3-319-55911-7_47

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-55911-7_47

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-55910-0

  • Online ISBN: 978-3-319-55911-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation