{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T13:43:44Z","timestamp":1648907024714},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,8,27]],"date-time":"2009-08-27T00:00:00Z","timestamp":1251331200000},"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":[[2010,4]]},"DOI":"10.1007\/s10878-009-9258-1","type":"journal-article","created":{"date-parts":[[2009,8,26]],"date-time":"2009-08-26T15:52:04Z","timestamp":1251301924000},"page":"415-427","source":"Crossref","is-referenced-by-count":2,"title":["Galaxy cutsets in graphs"],"prefix":"10.1007","volume":"19","author":[{"given":"Nicolas","family":"Sonnerat","sequence":"first","affiliation":[]},{"given":"Adrian","family":"Vetta","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,8,27]]},"reference":[{"issue":"2","key":"9258_CR1","doi-asserted-by":"crossref","first-page":"781","DOI":"10.4007\/annals.2004.160.781","volume":"160","author":"M Agrawal","year":"2004","unstructured":"Agrawal M, Kayal N, Saxena N (2004) PRIMES is in P. Ann Math 160(2):781\u2013793","journal-title":"Ann Math"},{"key":"9258_CR2","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0095-8956(85)90049-8","volume":"39","author":"V Chv\u00e1tal","year":"1985","unstructured":"Chv\u00e1tal V (1985) Star-cutsets and perfect graphs. J Comb Theory B 39:189\u2013199","journal-title":"J Comb Theory B"},{"key":"9258_CR3","first-page":"2","volume":"70","author":"G Cornu\u00e9jols","year":"2003","unstructured":"Cornu\u00e9jols G (2003) The strong perfect graph theorem. Optima 70:2\u20136","journal-title":"Optima"},{"issue":"16","key":"9258_CR4","doi-asserted-by":"crossref","first-page":"2094","DOI":"10.1016\/j.disc.2005.12.053","volume":"307","author":"S Finbow","year":"2007","unstructured":"Finbow S, King A, MacGillivray G, Rizzi R (2007) The firefighter problem for graphs of maximum degree three. Discrete Math 307(16):2094\u20132105","journal-title":"Discrete Math"},{"issue":"3","key":"9258_CR5","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0166-218X(85)90075-7","volume":"11","author":"G Gunther","year":"1985","unstructured":"Gunther G (1985) Neighbour-connectivity in regular graphs. Discrete Appl Math 11(3):233\u2013243","journal-title":"Discrete Appl Math"},{"key":"9258_CR6","unstructured":"Hartnell BL (1995) Firefighter! An application of domination, Presentation. 24th Manitoba Conference on Combinatorial Mathematics and Computing"},{"key":"9258_CR7","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2003) Maximizing the spread of influence through a social network, In: KDD \u201903: Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"9258_CR8","first-page":"236","volume-title":"Approximation algorithms for NP-hard problems","author":"S Khuller","year":"1995","unstructured":"Khuller S (1995) Approximation algorithms for finding highly connected subgraphs. In: Hochbaum D (ed) Approximation algorithms for NP-hard problems. PWS, Boston, pp 236\u2013265"},{"key":"9258_CR9","volume-title":"Handbook on approximation algorithms and metaheuristics","author":"G Kortsarz","year":"2007","unstructured":"Kortsarz G, Nutov Z (2007) Approximating minimum cost connectivity problems. In: Gonzalez T (ed) Handbook on approximation algorithms and metaheuristics. Chapman & Hall\/CRC, Boca Raton. Chap\u00a058"},{"key":"9258_CR10","unstructured":"Sonnerat N, Vetta A (2007) Network connectivity and malicious attacks. Preprint"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9258-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-009-9258-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9258-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:14Z","timestamp":1559276294000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-009-9258-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,27]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,4]]}},"alternative-id":["9258"],"URL":"https:\/\/doi.org\/10.1007\/s10878-009-9258-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,8,27]]}}}