Abstract
We present an \(\mathcal{O} (1.7548^n)\) algorithm finding a minimum feedback vertex set in a graph on n vertices.
Additional support by the Research Council of Norway.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dehne, F., Fellows, M.R., Langston, M.A., Rosamond, F.A., Stevens, K.: An O(2O(k) n 3) FPT algorithm for the undirected feedback vertex set problem. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 859–869. Springer, Heidelberg (2005)
Festa, P., Pardalos, P.M., Resende, M.G.C.: Feedback set problems. In: Handbook of combinatorial optimization, Supplement, vol. A, pp. 209–258. Kluwer Acad. Publ., Dordrecht (1999)
Fomin, F.V., Grandoni, F., Kratsch, D.: Measure and conquer: A simple O (20.288 n) independent set algorithm. In: 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), New York, pp. 18–25. ACM and SIAM (2006)
Guo, J., Niedermeier, R., Wernicke, S.: Parameterized complexity of generalized vertex cover problems. In: Dehne, F., López-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol. 3608, pp. 36–48. Springer, Heidelberg (2005)
Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of computer computations, pp. 85–103. Plenum Press, New York (1972)
Schwikowski, B., Speckenmeyer, E.: On Computing All Minimal Solutions for Feedback Problems. Discrete Applied Mathematics 117(1-3), 253–265 (2002)
Raman, V., Saurabh, S., Subramanian, C.R.: Faster fixed parameter tractable algorithms for undirected feedback vertex set. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol. 2518, pp. 241–248. Springer, Heidelberg (2002)
Razgon, I.: Exact computation of maximum induced forest. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol. 4059, pp. 160–171. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fomin, F.V., Gaspers, S., Pyatkin, A.V. (2006). Finding a Minimum Feedback Vertex Set in Time \(\mathcal{O} (1.7548^n)\) . In: Bodlaender, H.L., Langston, M.A. (eds) Parameterized and Exact Computation. IWPEC 2006. Lecture Notes in Computer Science, vol 4169. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11847250_17
Download citation
DOI: https://doi.org/10.1007/11847250_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-39098-5
Online ISBN: 978-3-540-39101-2
eBook Packages: Computer ScienceComputer Science (R0)