{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:47:16Z","timestamp":1725558436297},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642137303"},{"type":"electronic","value":"9783642137310"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13731-0_10","type":"book-chapter","created":{"date-parts":[[2010,6,10]],"date-time":"2010-06-10T11:00:50Z","timestamp":1276167650000},"page":"93-104","source":"Crossref","is-referenced-by-count":31,"title":["On Feedback Vertex Set New Measure and New Structures"],"prefix":"10.1007","author":[{"given":"Yixin","family":"Cao","sequence":"first","affiliation":[]},{"given":"Jianer","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Yang","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1613\/jair.638","volume":"12","author":"A. Becker","year":"2000","unstructured":"Becker, A., Bar-Yehuda, R., Geiger, D.: Randomized algorithms for the loop cutset problem. J. Artif. Intell. Res.\u00a012, 219\u2013234 (2000)","journal-title":"J. Artif. Intell. Res."},{"issue":"1","key":"10_CR2","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1142\/S0129054194000049","volume":"5","author":"H. Bodlaender","year":"1994","unstructured":"Bodlaender, H.: On disjoint cycles. Int. J. Found. Comput. Sci.\u00a05(1), 59\u201368 (1994)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Cao, Y., Chen, J., Liu, Y.: On Feedback Vertex Set New Measure and New Structures (manuscript, 2010)","DOI":"10.1007\/978-3-642-13731-0_10"},{"key":"10_CR4","first-page":"625","volume-title":"The Handbook of Graph Theory","author":"J. Chen","year":"2003","unstructured":"Chen, J.: Minimum and maximum imbeddings. In: Gross, J., Yellen, J. (eds.) The Handbook of Graph Theory, pp. 625\u2013641. CRC Press, Boca Raton (2003)"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"1188","DOI":"10.1016\/j.jcss.2008.05.002","volume":"74","author":"J. Chen","year":"2008","unstructured":"Chen, J., Fomin, F.V., Liu, Y., Lu, S., Villanger, Y.: Improved algorithms for the feedback vertex set problems. Journal of Computer and System Sciences\u00a074, 1188\u20131198 (2008)","journal-title":"Journal of Computer and System Sciences"},{"key":"10_CR6","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press and McGraw-Hill Book Company (2001)"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1007\/11533719_87","volume-title":"Computing and Combinatorics","author":"F. Dehne","year":"2005","unstructured":"Dehne, F., Fellows, M., Langston, M., Rosamond, F., Stevens, K.: An O(2 O(k) n 3) fpt algorithm for the undirected feedback vertex set problem. In: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, pp. 859\u2013869. Springer, Heidelberg (2005)"},{"key":"10_CR8","first-page":"191","volume-title":"Complexity Theory: Current Research","author":"R. Downey","year":"1992","unstructured":"Downey, R., Fellows, M.: Fixed parameter tractability and completeness. In: Complexity Theory: Current Research, pp. 191\u2013225. Cambridge University Press, Cambridge (1992)"},{"key":"10_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R. Downey","year":"1999","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Springer, New York (1999)"},{"key":"10_CR10","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/978-1-4757-3023-4_4","volume-title":"Handbook of Combinatorial Optimization","author":"P. Festa","year":"1999","unstructured":"Festa, P., Pardalos, P., Resende, M.: Feedback set problems. In: Handbook of Combinatorial Optimization, vol.\u00a0A(suppl.), pp. 209\u2013258. Kluwer Acad. Publ., Dordrecht (1999)"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/11847250_17","volume-title":"Parameterized and Exact Computation","author":"F. Fomin","year":"2006","unstructured":"Fomin, F., Gaspers, S., Pyatkin, A.: Finding a minimum feedback vertex set in time O(1.7548 n ). In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 184\u2013191. Springer, Heidelberg (2006)"},{"issue":"3","key":"10_CR12","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1145\/44483.44485","volume":"35","author":"M. Furst","year":"1988","unstructured":"Furst, M., Gross, J., McGeoch, L.: Finding a maximum-genus graph imbedding. Journal of the ACM\u00a035(3), 523\u2013534 (1988)","journal-title":"Journal of the ACM"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/BFb0015746","volume-title":"Automata, Languages and Programming","author":"H. Gabow","year":"1985","unstructured":"Gabow, H., Stallmann, M.: Efficient algorithms for graphic matroid intersection and parity. In: Brauer, W. (ed.) ICALP 1985. LNCS, vol.\u00a0194, pp. 210\u2013220. Springer, Heidelberg (1985)"},{"issue":"8","key":"10_CR14","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, J., H\u00fcffner, F., Niedermeier, R., Wernicke, S.: Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. J. Comput. Syst. Sci.\u00a072(8), 1386\u20131396 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/978-3-540-28639-4_21","volume-title":"Parameterized and Exact Computation","author":"I. Kanj","year":"2004","unstructured":"Kanj, I., Pelsmajer, M., Schaefer, M.: Parameterized algorithms for feedback vertex set. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol.\u00a03162, pp. 235\u2013247. Springer, Heidelberg (2004)"},{"key":"10_CR16","doi-asserted-by":"crossref","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.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"issue":"4","key":"10_CR17","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/S0252-9602(17)30520-9","volume":"19","author":"D. Li","year":"1999","unstructured":"Li, D., Liu, Y.: A polynomial algorithm for finding the minimul feedback vertex set of a 3-regular simple graph. Acta Mathematica Scientia\u00a019(4), 375\u2013381 (1999)","journal-title":"Acta Mathematica Scientia"},{"key":"10_CR18","unstructured":"Lov\u00e1sz, L.: The matroid matching problem. In: Algebraic Methods in Graph Theory, Colloquia Mathematica Societatis J\u00e1nos Bolyai, Szeged, Hungary (1978)"},{"issue":"3","key":"10_CR19","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1145\/1159892.1159898","volume":"2","author":"V. Raman","year":"2006","unstructured":"Raman, V., Saurabh, S., Subramanian, C.: Faster fixed parameter tractable algorithms for finding feedback vertex sets. ACM Trans. Algorithms\u00a02(3), 403\u2013415 (2006)","journal-title":"ACM Trans. Algorithms"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/3-540-36136-7_22","volume-title":"Algorithms and Computation","author":"V. Raman","year":"2002","unstructured":"Raman, V., Saurabh, S., Subramanian, C.: Faster fixed parameter tractable algorithms for undirected feedback vertex set. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol.\u00a02518, pp. 241\u2013248. Springer, Heidelberg (2002)"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/11785293_17","volume-title":"Algorithm Theory \u2013 SWAT 2006","author":"I. Razgon","year":"2006","unstructured":"Razgon, I.: Exact computation of maximum induced forest. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol.\u00a04059, pp. 160\u2013171. Springer, Heidelberg (2006)"},{"issue":"4","key":"10_CR22","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, K., Vetta, A.: Finding odd cycle transversals. Oper. Res. Lett.\u00a032(4), 299\u2013301 (2004)","journal-title":"Oper. Res. Lett."},{"key":"10_CR23","volume-title":"Operating System Concepts","author":"A. Silberschatz","year":"1994","unstructured":"Silberschatz, A., Galvin, P.: Operating System Concepts, 4th edn. Addison-Wesley, Reading (1994)","edition":"4"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13731-0_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:42:18Z","timestamp":1606185738000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13731-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642137303","9783642137310"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13731-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}