Skip to main content
SpringerLink
Log in

An FPT Algorithm for Tree Deletion Set

  • Conference paper
WALCOM: Algorithms and Computation (WALCOM 2013)

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

Included in the following conference series:

  • 1049 Accesses

Abstract

We give a 5k n O(1) fixed-parameter algorithm for determining whether a given undirected graph on n vertices has a subset of at most k vertices whose deletion results in a tree. Such a subset is a restricted form of a feedback vertex set. While parameterized complexity of feedback vertex set problem and several of its variations have been well studied, to the best of our knowledge, this is the first fixed-parameter algorithm for this version of feedback vertex set.

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 39.99
Price excludes VAT (USA)
  • Available as 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bafna, V., Berman, P., Fujito, T.: A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM J. Discrete Math. 12, 289–297 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  2. Cao, Y., Chen, J., Liu, Y.: On Feedback Vertex Set New Measure and New Structures. In: Kaplan, H. (ed.) SWAT 2010. LNCS, vol. 6139, pp. 93–104. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  3. Chen, J., Fomin, F.V., Liu, Y., Lu, S., Villanger, Y.: Improved algorithms for feedback vertex set problems. J. Comput. Syst. Sci. 74, 1188–1198 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  4. Chitnis, R., Cygan, M., Hajiaghayi, M., Marx, D.: Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part I. LNCS, vol. 7391, pp. 230–241. Springer, Heidelberg (2012)

    Google Scholar 

  5. Cygan, M., Pilipczuk, M., Pilipczuk, M., Wojtaszczyk, J.O.: Subset Feedback Vertex Set Is Fixed-Parameter Tractable. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol. 6755, pp. 449–461. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  6. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, New York (1999)

    Book  Google Scholar 

  7. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Berlin (2006)

    Google Scholar 

  8. Fomin, F.V., Gaspers, S., Pyatkin, A.V., Razgon, I.: On the minimum feedback vertex set problem: Exact and enumeration algorithms. Algorithmica 52, 293–307 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  9. Fomin, F.V., Lokshtanov, D., Misra, N., Saurabh, S.: Planar F-deletion: Approximation, kernelization and optimal fpt algorithms. To appear in FOCS 2012 (2012)

    Google Scholar 

  10. Fredman, M.L., Willard, D.E.: Trans-dichotomous algorithms for minimum spanning trees and shortest paths. Journal of Computer and System Sciences 48, 533–551 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  11. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company (1979)

    Google Scholar 

  12. Kim, E.J., Langer, A., Paul, C., Reidl, F., Rossmanith, P., Sau, I., Sikdar, S.: Linear kernels and single-exponential algorithms via protrusion decompositions. CoRR, abs/1207.0835 (2012)

    Google Scholar 

  13. Lokshtanov, D., Narayanaswamy, N.S., Raman, V., Ramanujan, M.S., Saurabh, S.: Faster parameterized algorithms using linear programming. CoRR, abs/1203.0833 (2012)

    Google Scholar 

  14. Marx, D., O’Sullivan, B., Razgon, I.: Treewidth reduction for constrained separation and bipartization problems. In: Marion, J.-Y., Schwentick, T. (eds.) STACS. LIPIcs, vol. 5, pp. 561–572. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2010)

    Google Scholar 

  15. Misra, N., Philip, G., Raman, V., Saurabh, S.: On Parameterized Independent Feedback Vertex Set. In: Fu, B., Du, D.-Z. (eds.) COCOON 2011. LNCS, vol. 6842, pp. 98–109. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  16. Misra, N., Philip, G., Raman, V., Saurabh, S., Sikdar, S.: FPT algorithms for connected feedback vertex set. J. Comb. Optim. 24, 131–146 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  17. Mölle, D., Richter, S., Rossmanith, P.: Enumerate and expand: Improved algorithms for connected vertex cover and tree cover. Theory Comput. Syst. 43, 234–253 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  18. Narayanaswamy, N.S., Raman, V., Ramanujan, M.S., Saurabh, S.: LP can be a cure for parameterized problems. In: STACS, pp. 338–349 (2012)

    Google Scholar 

  19. Niedermeier, R.: Invitation to Fixed Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications. Oxford University Press, USA (2006)

    Book  MATH  Google Scholar 

  20. Thomassé, S.: A 4k 2 kernel for feedback vertex set. ACM Transactions on Algorithms 6 (2010)

    Google Scholar 

  21. Villanger, Y.: Proper Interval Vertex Deletion. In: Raman, V., Saurabh, S. (eds.) IPEC 2010. LNCS, vol. 6478, pp. 228–238. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  22. Yannakakis, M.: The effect of a connectivity requirement on the complexity of maximum subgraph problems. J. ACM 26, 618–630 (1979)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Institute of Mathematical Sciences, Chennai, India

    Venkatesh Raman & Saket Saurabh

  2. Faculty of Information Technology, Czech Technical University, Prague, Czech Republic

    Ondřej Suchý

Authors
  1. Venkatesh Raman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Saket Saurabh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ondřej Suchý
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Technology and Computer Science, Tata Institute of Fundamental Research, Homi Bhabha Road, 400005, Mumbai, India

    Subir Kumar Ghosh

  2. Graduate School of Information Sciences (GSIS), Tohoku University, Aobayama Campus, GSIS Building, 980-8578, Sendai, Japan

    Takeshi Tokuyama

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Raman, V., Saurabh, S., Suchý, O. (2013). An FPT Algorithm for Tree Deletion Set . In: Ghosh, S.K., Tokuyama, T. (eds) WALCOM: Algorithms and Computation. WALCOM 2013. Lecture Notes in Computer Science, vol 7748. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36065-7_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-36065-7_27

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation