Skip to main content
SpringerLink
Log in

An Improved Kernel for the Undirected Planar Feedback Vertex Set Problem

  • Conference paper
Book cover Parameterized and Exact Computation (IPEC 2012)

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

Included in the following conference series:

Abstract

We consider the parameterized Feedback Vertex Set problem on unweighted, undirected planar graphs. We present a kernelization algorithm that takes a planar graph G and an integer k as input and either decides that (G,k) is a no instance or produces an equivalent (kernel) instance (G′,k′) such that k′ ≤ k and |V(G′)| < 97k. In addition to the improved kernel bound (from 112k to 97k), our algorithm features simple linear-time reduction procedures that can be applied to the general Feedback Vertex Set problem.

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

Access this chapter

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 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 72.00
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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bar-Yehuda, R., Geiger, D., Naor, J.(S.), Roth, R.M.: Approximation algorithms for the vertex feedback set problem with applications to constraint satisfaction and bayesian inference. In: SODA 1994: Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, PA, USA, pp. 344–354. Society for Industrial and Applied Mathematics (1994)

    Google Scholar 

  2. Bodlaender, H.L.: A Cubic Kernel for Feedback Vertex Set. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 320–331. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  3. Bodlaender, H.L., Fomin, F.V., Lokshtanov, D., Penninkx, E., Saurabh, S., Thilikos, D.M.: (meta) kernelization. In: Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, pp. 629–638. IEEE Computer Society, Washington, DC (2009)

    Chapter  Google Scholar 

  4. Bodlaender, H.L., Penninkx, E.: A Linear Kernel for Planar Feedback Vertex Set. In: Grohe, M., Niedermeier, R. (eds.) IWPEC 2008. LNCS, vol. 5018, pp. 160–171. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  5. Burrage, K., Estivill-Castro, V., Fellows, M.R., Langston, M.A., Mac, S., Rosamond, F.A.: The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 192–202. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  6. Chen, J., Fomin, F.V., Liu, Y., Lu, S., Villanger, Y.: Improved Algorithms for the Feedback Vertex Set Problems. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol. 4619, pp. 422–433. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  7. Dechter, R.: Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition. Artificial Intelligence 41(3), 273–312 (1990)

    Article  Google Scholar 

  8. Dehne, F., Fellows, M.R., Langston, M.A., Rosamond, F.A., Stevens, K.: An o *(2O(k)) FPT Algorithm for the Undirected Feedback Vertex Set Problem. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 859–869. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  9. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)

    Google Scholar 

  10. Fomin, F.V., Lokshtanov, D., Saurabh, S., Thilikos, D.M.: Bidimensionality and kernels. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Philadelphia, PA, USA, pp. 503–510. Society for Industrial and Applied Mathematics (2010)

    Google Scholar 

  11. Garey, M.R., Johnson, D.S.: Computers and Intractability. W. H. Freeman, New York (1979)

    MATH  Google Scholar 

  12. Guo, J., Gramm, J., Hüffner, F., Niedermeier, R., Wernicke, S.: Improved Fixed-Parameter Algorithms for Two Feedback Set Problems. In: Dehne, F., López-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol. 3608, pp. 158–168. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  13. Raman, V., Saurabh, S., Subramanian, C.R.: Faster fixed parameter tractable algorithms for finding feedback vertex sets. ACM Trans. Algorithms 2(3), 403–415 (2006)

    Article  MathSciNet  Google Scholar 

  14. Thomassé, S.: A 4k 2 kernel for feedback vertex set. ACM Transactions on Algorithms TALG 6(2), 1–8 (2010)

    Article  Google Scholar 

  15. Yannakakis, M.: Node-and edge-deletion np-complete problems. In: STOC 1978: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, pp. 253–264. ACM, New York (1978)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Mathematics, Lebanese American University, Beirut, Lebanon

    Faisal N. Abu-Khzam

  2. Department of Mathematics, Kuwait University, Al Safat, Kuwait

    Mazen Bou Khuzam

Authors
  1. Faisal N. Abu-Khzam
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mazen Bou Khuzam
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, National and Kapodistrian University of Athens, Panepistimioupolis, 15784, Athens, Greece

    Dimitrios M. Thilikos

  2. Department of Mathematics and Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    Gerhard J. Woeginger

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Abu-Khzam, F.N., Bou Khuzam, M. (2012). An Improved Kernel for the Undirected Planar Feedback Vertex Set Problem. In: Thilikos, D.M., Woeginger, G.J. (eds) Parameterized and Exact Computation. IPEC 2012. Lecture Notes in Computer Science, vol 7535. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33293-7_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33293-7_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33292-0

  • Online ISBN: 978-3-642-33293-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation