{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T05:18:16Z","timestamp":1648617496518},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,9,20]],"date-time":"2014-09-20T00:00:00Z","timestamp":1411171200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1007\/s10878-014-9790-5","type":"journal-article","created":{"date-parts":[[2014,9,19]],"date-time":"2014-09-19T06:07:50Z","timestamp":1411106870000},"page":"815-832","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis"],"prefix":"10.1007","volume":"31","author":[{"given":"Chun-Ying","family":"Chiang","sequence":"first","affiliation":[]},{"given":"Wei-Ting","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Hong-Gwa","family":"Yeh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,9,20]]},"reference":[{"key":"9790_CR1","doi-asserted-by":"crossref","unstructured":"Ackerman E, Ben-Zwi O, Wolfovitz G (2010) Combinatorial model and bounds for target set selection. Theoret Comput Sci 411:4017\u20134022","DOI":"10.1016\/j.tcs.2010.08.021"},{"key":"9790_CR2","doi-asserted-by":"crossref","first-page":"4049","DOI":"10.1016\/j.camwa.2011.09.047","volume":"62","author":"SS Adams","year":"2011","unstructured":"Adams SS, Troxell DS, Zinnen SL (2011) Dynamic monopolies and feedback vertex sets in hexagonal grids. Comput Math Appl 62:4049\u20134057","journal-title":"Comput Math Appl"},{"key":"9790_CR3","first-page":"357","volume-title":"Graph theory and related topics","author":"MO Albertson","year":"1979","unstructured":"Albertson MO, Berman D (1979) A conjecture on planar graphs. Graph theory and related topics. Academic Press, New York, p 357"},{"key":"9790_CR4","first-page":"285","volume":"25","author":"S Bau","year":"2002","unstructured":"Bau S, Beineke LW (2002) The decycling number of graphs. Australas J Comb 25:285\u2013298","journal-title":"Australas J Comb"},{"key":"9790_CR5","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":"9790_CR6","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.disopt.2010.09.007","volume":"8","author":"O Ben-Zwi","year":"2011","unstructured":"Ben-Zwi O, Hermelin D, Lokshtanov D, Newman I (2011) Treewidth governs the complexity of target set selection. Discret Optim 8:87\u201396","journal-title":"Discret Optim"},{"key":"9790_CR7","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1006\/jctb.2001.2045","volume":"83","author":"E Berger","year":"2001","unstructured":"Berger E (2001) Dynamic monopolies of constant size. J Comb Theory Ser B 83:191\u2013200","journal-title":"J Comb Theory Ser B"},{"key":"9790_CR8","first-page":"433","volume":"3","author":"G Chartrand","year":"1967","unstructured":"Chartrand G, Harary F (1967) Planar permutation graphs. Ann Inst Henri Poincar\u00e9 Sect B 3:433\u2013438","journal-title":"Ann Inst Henri Poincar\u00e9 Sect B"},{"key":"9790_CR9","first-page":"21","volume-title":"Proof techniques in graph theory, proceedings of the second ann arbor graph theory conference","author":"G Chartrand","year":"1968","unstructured":"Chartrand G, Frechen JB (1968) On the chromatic number of permutation graphs. In: Harary F (ed) Proof techniques in graph theory, proceedings of the second ann arbor graph theory conference. Academic Press, New York, pp 21\u201324"},{"key":"9790_CR10","doi-asserted-by":"crossref","unstructured":"Chen N (2009) On the approximability of influence in social networks. SIAM J Discret Math 23:1400\u20131415","DOI":"10.1137\/08073617X"},{"key":"9790_CR11","doi-asserted-by":"crossref","unstructured":"Chiang C-Y, Huang L-H, Li B-J, Wu J, Yeh H-G (2013) Some results on the target set selection problem. J Comb Optim 25:702\u2013715","DOI":"10.1007\/s10878-012-9518-3"},{"key":"9790_CR12","doi-asserted-by":"crossref","unstructured":"Chiang C-Y, Huang L-H, Yeh H-G (2013) Target set selection problem for honeycomb networks. SIAM J Discret Math 23:310\u2013328","DOI":"10.1137\/120868864"},{"key":"9790_CR13","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1090\/S0002-9904-1950-09407-5","volume":"56","author":"HSM Coxeter","year":"1950","unstructured":"Coxeter HSM (1950) Self-dual configurations and regular graphs. Bull Am Math Soc 56:413\u2013455","journal-title":"Bull Am Math Soc"},{"key":"9790_CR14","doi-asserted-by":"crossref","unstructured":"Domingos P, Richardson M (2001) Mining the network value of customers. In: Proceedings of ACM SIGKDD 2001, San Francisco, pp 57\u201366","DOI":"10.1145\/502512.502525"},{"key":"9790_CR15","doi-asserted-by":"crossref","first-page":"1615","DOI":"10.1016\/j.dam.2008.09.012","volume":"157","author":"PA Dreyer","year":"2009","unstructured":"Dreyer PA, Roberts FS (2009) Irreversible $$k$$ k -threshold processes: graph-theoretical threshold models of the spread of disease and of opinion. Discret Appl Math 157:1615\u20131627","journal-title":"Discret Appl Math"},{"key":"9790_CR16","first-page":"209","volume-title":"Handbook of combinatorial optimization","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, vol A. Kluwer Academic Publishers, Dordrecht, pp 209\u2013259"},{"key":"9790_CR17","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0166-218X(00)00388-7","volume":"113","author":"P Flocchini","year":"2001","unstructured":"Flocchini P, Geurts F, Santoro N (2001) Optimal irreversible dynamos in chordal rings. Discret Appl Math 113:23\u201342","journal-title":"Discret Appl Math"},{"key":"9790_CR18","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S1570-8667(03)00022-4","volume":"1","author":"P Flocchini","year":"2003","unstructured":"Flocchini P, Kr\u00e1lovi\u010d R, Ru\u017ai\u010dka P, Roncato A, Santoro N (2003) On time versus size for monotone dynamic monopolies in regular topologies. J Discret Algorithms 1:129\u2013150","journal-title":"J Discret Algorithms"},{"key":"9790_CR19","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0166-218X(03)00261-0","volume":"137","author":"P Flocchini","year":"2004","unstructured":"Flocchini P, Lodi E, Luccio F, Pagli L, Santoro N (2004) Dynamic monopolies in tori. Discret Appl Math 137:197\u2013212","journal-title":"Discret Appl Math"},{"key":"9790_CR20","first-page":"183","volume":"4","author":"P Flocchini","year":"2009","unstructured":"Flocchini P (2009) Contamination and decontamination in majority-based systems. J Cell Autom 4:183\u2013200","journal-title":"J Cell Autom"},{"key":"9790_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0020-0190(00)00127-7","volume":"76","author":"R Focardi","year":"2000","unstructured":"Focardi R, Luccio FL, Peleg D (2000) Feedback vertex set in hypercubes. Inform Process Lett 76:1\u20135","journal-title":"Inform Process Lett"},{"key":"9790_CR22","unstructured":"Garey MR, Johnson DS (1979) Computers and Intractability: a guide to the theory of NP-completeness. In: Freeman WH (ed) A series of books in the mathematical sciences. Freeman&Co, San Francisco"},{"key":"9790_CR23","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos E (2003) Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD international conference on knowledge discovery and data mining, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"9790_CR24","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos E (2005) Influential nodes in a diffusion model for social networks. In: Proceedings of the 32th international colloquium on automata, languages and programming, pp 1127\u20131138","DOI":"10.1007\/11523468_91"},{"key":"9790_CR25","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 (1999) A polynomial algorithm for finding the minimum feedback vertex set of a $$3$$ 3 -regular simple graph. Acta Math Sci 19:375\u2013381","journal-title":"Acta Math Sci"},{"key":"9790_CR26","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/S0020-0190(98)00039-8","volume":"66","author":"F Luccio","year":"1998","unstructured":"Luccio F (1998) Almost exact minimum feedback vertex set in meshes and butterflies. Inf Process Lett 66:59\u201364","journal-title":"Inf Process Lett"},{"key":"9790_CR27","unstructured":"Luccio F, Pagli L, Sanossian H (1999) Irreversible dynamos in butterflies. In: 6th international colloquium on structural information and communication complexity (SIROCCO), pp 204\u2013218"},{"key":"9790_CR28","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. Discret Appl Math 86:263\u2013273","journal-title":"Discret Appl Math"},{"key":"9790_CR29","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 majorities, coalitions and monopolies in graphs: a review. Theoret Comput Sci 282:231\u2013257","journal-title":"Theoret Comput Sci"},{"key":"9790_CR30","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1137\/S089548010444016X","volume":"19","author":"DA Pike","year":"2005","unstructured":"Pike DA, Zou Y (2005) Decycling cartesian products of two cycles. SIAM J Discret Math 19:651\u2013663","journal-title":"SIAM J Discret Math"},{"key":"9790_CR31","doi-asserted-by":"crossref","unstructured":"Richardson M, Domingos P (2002) Mining knowledge-sharing sites for viral marketing. In: Proceedings of the 8th ACM SIGKDD, Edmonton, Canada, pp 61\u201370","DOI":"10.1145\/775047.775057"},{"key":"9790_CR32","unstructured":"Roberts FS (2006) Graph-theoretical problems arising from defending against bioterrorism and controlling the spread of fires. In: Proceedings of the DIMACS\/DIMATIA\/Renyi combinatorial challenges conference, Piscataway, NJ"},{"key":"9790_CR33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/1.9780898717518.ch1","volume-title":"Bioterrorism: mathematical modeling applications in homeland security, Front. Appl. Mathem.","author":"FS Roberts","year":"2003","unstructured":"Roberts FS (2003) Challenges for discrete mathematics and theoretical computer science in the defense against bioterrorism. In: Banks HT, Castillo-Chave C (eds) Bioterrorism: mathematical modeling applications in homeland security, Front. Appl. Mathem., vol 28. SIAM, Philadelphia, pp 1\u201334"},{"key":"9790_CR34","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1137\/0208051","volume":"8","author":"A Shamir","year":"1979","unstructured":"Shamir A (1979) A linear time algorithm for finding minimum cutsets in reduced graphs. SIAM J Comput 8:654\u2013655","journal-title":"SIAM J Comput"},{"key":"9790_CR35","doi-asserted-by":"crossref","unstructured":"Speckenmeyer E (1988) On the feedback vertex sets and nonseparating independent sets in cubic graphs. J Graph Theory 12:405\u2013412","DOI":"10.1002\/jgt.3190120311"},{"key":"9790_CR36","doi-asserted-by":"crossref","unstructured":"Stueckle S, Ringeisen RD (1984) Generalized Petersen graphs which are cycle permutation graphs. J Comb Theory B 37:142\u2013150","DOI":"10.1016\/0095-8956(84)90068-6"},{"key":"9790_CR37","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/0012-365X(88)90226-9","volume":"72","author":"S Ueno","year":"1988","unstructured":"Ueno S, Kajitani Y, Gotoh S (1988) On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three. Discret Math 72:355\u2013360","journal-title":"Discret Math"},{"key":"9790_CR38","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1145\/3149.3159","volume":"32","author":"C Wang","year":"1985","unstructured":"Wang C, Lloyd E, Soffa M (1985) Feedback vertex sets and cyclically reducible graphs. J ACM 32:296\u2013313","journal-title":"J ACM"},{"key":"9790_CR39","doi-asserted-by":"crossref","unstructured":"Watkins ME (1969) A theorem on Tait colorings with an application to the generalized Petersen graphs. J Comb Theory 6:152\u2013164","DOI":"10.1016\/S0021-9800(69)80116-X"},{"key":"9790_CR40","unstructured":"Yehuda B, Geiger D, Naor J, Roth RM (1994) Approximation algorithms for the vertex feedback set problem with applications to constraint satisfaction and Bayesian inference. In: Proceedings of the 5th annual ACM-SIAM symposium on discrete algorithms, pp 344\u2013354"},{"key":"9790_CR41","doi-asserted-by":"crossref","first-page":"1136","DOI":"10.1016\/j.disc.2011.11.038","volume":"312","author":"M Zaker","year":"2012","unstructured":"Zaker M (2012) On dynamic monopolies of graphs with general thresholds. Discret Math 312:1136\u20131143","journal-title":"Discret Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9790-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9790-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9790-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,15]],"date-time":"2019-08-15T01:13:31Z","timestamp":1565831611000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9790-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,20]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,2]]}},"alternative-id":["9790"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9790-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,20]]}}}