{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T15:18:31Z","timestamp":1726413511276},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T00:00:00Z","timestamp":1330128000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1007\/s10878-012-9455-1","type":"journal-article","created":{"date-parts":[[2012,2,24]],"date-time":"2012-02-24T18:59:44Z","timestamp":1330109984000},"page":"536-542","source":"Crossref","is-referenced-by-count":3,"title":["The decycling number of outerplanar graphs"],"prefix":"10.1007","volume":"25","author":[{"given":"Huilan","family":"Chang","sequence":"first","affiliation":[]},{"given":"Hung-Lin","family":"Fu","sequence":"additional","affiliation":[]},{"given":"Min-Yun","family":"Lien","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,2,25]]},"reference":[{"key":"9455_CR1","doi-asserted-by":"crossref","first-page":"942","DOI":"10.1137\/S0097539796305109","volume":"27","author":"R Bar-Yehuda","year":"1998","unstructured":"Bar-Yehuda R, Geiger D, Naor J, Roth RM (1998) Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and Bayesian inference. SIAM J Comput 27:942\u2013959","journal-title":"SIAM J Comput"},{"key":"9455_CR2","first-page":"79","volume":"134","author":"S Bau","year":"1998","unstructured":"Bau S, Beineke LW, Vandell RC (1998) Decycling snakes. Congr Numer 134:79\u201387","journal-title":"Congr Numer"},{"key":"9455_CR3","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/(SICI)1097-0118(199705)25:1<59::AID-JGT4>3.0.CO;2-H","volume":"25","author":"LW Beineke","year":"1997","unstructured":"Beineke LW, Vandell RC (1997) Decycling graphs. J Graph Theory 25:59\u201377","journal-title":"J Graph Theory"},{"key":"9455_CR4","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1142\/S0129054194000049","volume":"5","author":"HL Bodlaender","year":"1994","unstructured":"Bodlaender HL (1994) On disjoint cycles. Int J Found Comput Sci 5:59\u201368","journal-title":"Int J Found Comput Sci"},{"key":"9455_CR5","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0095-8956(86)90028-6","volume":"41","author":"P Erd\u00f6s","year":"1986","unstructured":"Erd\u00f6s P, Saks M, S\u00f3s VT (1986) Maximum induced trees in graphs. J Comb Theory, Ser B 41:61\u201379","journal-title":"J Comb Theory, Ser B"},{"key":"9455_CR6","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/S0020-0190(02)00265-X","volume":"84","author":"G Fertin","year":"2002","unstructured":"Fertin G, Godard E, Raspaud A (2002) Minimum feedback vertex set and acyclic coloring. Inf Process Lett 84:131\u2013139","journal-title":"Inf Process Lett"},{"key":"9455_CR7","first-page":"209","volume-title":"Handbook of combinatorial optimization, supplement\u00a0A","author":"P Festa","year":"2000","unstructured":"Festa P, Pardalos PM, Resende MGC (2000) Feedback set problems. In: Du D-Z, Pardalos PM (eds) Handbook of combinatorial optimization, supplement\u00a0A. Kluwer Academic, Dordrecht, pp 209\u2013259"},{"key":"9455_CR8","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"DS Johnson","year":"1974","unstructured":"Johnson DS (1974) Approximation algorithms for combinatorial problems. J Comput Syst Sci 9:256\u2013278","journal-title":"J Comput Syst Sci"},{"key":"9455_CR9","doi-asserted-by":"crossref","first-page":"618","DOI":"10.2307\/2271828","volume":"40","author":"RM Karp","year":"1975","unstructured":"Karp RM, Miller RE, Thatcher JW (1975) Reducibility among combinatorial problems. J Symb Log 40:618\u2013619","journal-title":"J Symb Log"},{"key":"9455_CR10","first-page":"566","volume-title":"Proc 10th annual ACM-SIAM symposium on discrete algorithms (SODA 99)","author":"J Kleinberg","year":"1999","unstructured":"Kleinberg J, Kumar A (1999) Wavelength conversion in optical networks. In: Proc 10th annual ACM-SIAM symposium on discrete algorithms (SODA 99), pp 566\u2013575"},{"key":"9455_CR11","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1007\/3-540-36379-3_25","volume-title":"Proceedings of the 28th international workshop on graph-theoretic concepts in computer science (WG 2002)","author":"T Kloks","year":"2002","unstructured":"Kloks T, Lee C-M, Liu J (2002) New algorithms for k-face cover, k-feedback vertex set, and k-disjoint cycles on plane and planar graphs. In: Proceedings of the 28th international workshop on graph-theoretic concepts in computer science (WG 2002), vol 2573. Springer, Berlin, pp 282\u2013295"},{"key":"9455_CR12","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/S0166-218X(98)00043-2","volume":"86","author":"D Peleg","year":"1998","unstructured":"Peleg D (1998) Size bounds for dynamic monopolies. Discrete Appl Math 86:263\u2013273","journal-title":"Discrete Appl Math"},{"key":"9455_CR13","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0304-3975(01)00055-X","volume":"282","author":"D Peleg","year":"2002","unstructured":"Peleg D (2002) Local majority voting, small coalitions and controlling monopolies in graphs: a review. Theor Comput Sci 282:231\u2013257","journal-title":"Theor Comput Sci"},{"key":"9455_CR14","volume-title":"Operating systems concepts","author":"A Silberschatz","year":"2003","unstructured":"Silberschatz A, Galvin PB, Gagne G (2003) Operating systems concepts, 6th edn. Wiley, New York","edition":"6"},{"key":"9455_CR15","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1145\/3149.3159","volume":"32","author":"C Wang","year":"1985","unstructured":"Wang C, Lloyd EL, Soffa ML (1985) Feedback vertex sets and cyclically reducible graphs. J ACM 32:296\u2013313","journal-title":"J ACM"},{"key":"9455_CR16","volume-title":"Introduction to graph theory","author":"DB West","year":"2001","unstructured":"West DB (2001) Introduction to graph theory, 2nd edn. Prentice-Hall, New York","edition":"2"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9455-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-012-9455-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9455-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:17Z","timestamp":1559276597000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-012-9455-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,25]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["9455"],"URL":"https:\/\/doi.org\/10.1007\/s10878-012-9455-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2012,2,25]]}}}