{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:44:07Z","timestamp":1743133447387,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":14,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_450","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:37:34Z","timestamp":1214505454000},"page":"995-996","source":"Crossref","is-referenced-by-count":1,"title":["Undirected Feedback Vertex Set"],"prefix":"10.1007","author":[{"given":"Jiong","family":"Guo","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"450_CR1_450","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1137\/S0895480196305124","volume":"3","author":"V. Bafna","year":"1999","unstructured":"Bafna, V., Berman,\nP., Fujito, T.: A\u00a02-approximation algorithm for the undirected feedback vertex set\nproblem. SIAM J.\u00a0Discret. Math. 3(2), 289\u2013297\n(1999)","journal-title":"SIAM J. Discret. Math."},{"issue":"4","key":"450_CR2_450","doi-asserted-by":"publisher","first-page":"942","DOI":"10.1137\/S0097539796305109","volume":"27","author":"R. Bar-Yehuda","year":"1998","unstructured":"Bar-Yehuda, R.,\nGeiger, D., Naor, J., Roth, R.M.: Approximation algorithms for the feedback vertex set problem\nwith applications to constraint satisfaction and Bayesian inference. SIAM\nJ.\u00a0Comput. 27(4), 942\u2013959\n(1998)","journal-title":"SIAM J. Comput."},{"key":"450_CR3_450","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1613\/jair.638","volume":"12","author":"A. Becker","year":"2000","unstructured":"Becker, A.,\nBar-Yehuda, R., Geiger, D.: Randomized algorithms for the Loop Cutset problem.\nJ.\u00a0Artif.\u00a0Intell.\u00a0Res. 12, 219\u2013234\n(2000)","journal-title":"J. Artif. Intell. Res."},{"key":"450_CR4_450","first-page":"60","volume-title":"Proc. 10th Conference on Uncertainty in Artificial Intelligence","author":"A. Becker","year":"1994","unstructured":"Becker, A., Geiger,\nD.: Approximation algorithms for the Loop Cutset problem. In: Proc. 10th Conference on\nUncertainty in Artificial Intelligence, pp.\u00a060\u201368. Morgan Kaufman, San Fransisco\n(1994)"},{"issue":"1","key":"450_CR5_450","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1142\/S0129054194000049","volume":"5","author":"H.L. Bodlaender","year":"1994","unstructured":"Bodlaender, H.L.: On\ndisjoint cycles. Int.\u00a0J.\u00a0Found.\u00a0Comp.\u00a0Sci. 5(1), 59\u201368 (1994)","journal-title":"Int. J. Found. Comp. Sci."},{"key":"450_CR6_450","volume-title":"An $$ { O(2^{O(k)}n^{3}) } $$ FPT algorithm for the undirected feedback vertex set problem. Proceedings COCOON 2005. Lecture Notes in Computer Science, vol. 3595, pp. 859\u2013869","author":"F. Dehne","year":"2005","unstructured":"Dehne, F., Fellows,\nM.R., Langston, M.A., Rosamond, F., Stevens,\u00a0K.: An O(2\n                  O(k)\n                n\n                3) FPT algorithm for the undirected\nfeedback vertex set problem. In: Proc. 11th COCOON. LNCS, vol.\u00a03595,\npp.\u00a0859\u2013869. Springer, Berlin (2005). Long version to appear in:\nJ.\u00a0Discret. Algorithms"},{"key":"450_CR7_450","first-page":"161","volume":"87","author":"R.G. Downey","year":"1992","unstructured":"Downey, R.G.,\nFellows, M.R.: Fixed-parameter tractability and completeness. Congres. Numerant.\n87, 161\u2013187 (1992)","journal-title":"Congres. Numerant."},{"key":"450_CR8_450","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G.,\nFellows, M.R.: Parameterized Complexity. Springer, Heidelberg\n(1999)"},{"key":"450_CR9_450","first-page":"184","volume-title":"Proc. 2th IWPEC. LNCS, vol. 4196","author":"F.V. Fomin","year":"2006","unstructured":"Fomin, F.V.,\nGaspers, S., Pyatkin, A.V.: Finding a\u00a0minimum feedback vertex set in time O(1.7548\n                  n\n                ). In: Proc. 2th IWPEC. LNCS, vol.\u00a04196,\npp.\u00a0184\u2013191. Springer, Berlin (2006)"},{"issue":"8","key":"450_CR10_450","doi-asserted-by":"publisher","first-page":"1386","DOI":"10.1016\/j.jcss.2006.02.001","volume":"72","author":"J. Guo","year":"2006","unstructured":"Guo, J., Gramm,\nJ., H\u00fcffner, F., Niedermeier, R., Wernicke, S.: Compression-based fixed-parameter algorithms\nfor Feedback Vertex Set and Edge Bipartization. J.\u00a0Comp.\u00a0Syst.\u00a0Sci. 72(8), 1386\u20131396 (2006)","journal-title":"J. Comp. Syst. Sci."},{"key":"450_CR11_450","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R. Karp","year":"1972","unstructured":"Karp, R.:\nReducibility among combinatorial problems. In: Miller,\u00a0R., Thatcher, J. (eds.)\nComplexity of Computer Computations, pp.\u00a085\u2013103. Plenum Press, New York\n(1972)"},{"key":"450_CR12_450","first-page":"40","volume-title":"Proc. 20th ICALP. LNCS, vol. 700","author":"C. Lund","year":"1993","unstructured":"Lund, C.,\nYannakakis, M.: The approximation of maximum subgraph problems. In: Proc. 20th ICALP. LNCS,\nvol.\u00a0700, pp.\u00a040\u201351. Springer, Berlin (1993)"},{"key":"450_CR13_450","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.:\nInvitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford\n(2006)"},{"issue":"4","key":"450_CR14_450","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/j.orl.2003.10.009","volume":"32","author":"B. Reed","year":"2004","unstructured":"Reed, B., Smith,\nK., Vetta, A.: Finding odd cycle transversals. Oper.\u00a0Res.\u00a0Lett. 32(4), 299\u2013301 (2004)","journal-title":"Oper. Res. Lett."}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_450","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T02:01:47Z","timestamp":1662170507000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_450"}},"subtitle":["2005; Dehne, Fellows, Langston, Rosamond, Stevens\n            2005; Guo, Gramm, H\u00fcffner, Niedermeier, Wernicke"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_450","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}