{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T01:06:22Z","timestamp":1774487182939,"version":"3.50.1"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,6,29]],"date-time":"2012-06-29T00:00:00Z","timestamp":1340928000000},"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-9518-3","type":"journal-article","created":{"date-parts":[[2012,6,28]],"date-time":"2012-06-28T15:11:17Z","timestamp":1340896277000},"page":"702-715","source":"Crossref","is-referenced-by-count":58,"title":["Some results on the target set selection problem"],"prefix":"10.1007","volume":"25","author":[{"given":"Chun-Ying","family":"Chiang","sequence":"first","affiliation":[]},{"given":"Liang-Hao","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Bo-Jr","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jiaojiao","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Hong-Gwa","family":"Yeh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,6,29]]},"reference":[{"key":"9518_CR1","author":"O Ben-Zwi","year":"2010","unstructured":"Ben-Zwi O, Hermelin D, Lokshtanov D, Newman I (2010) Treewidth governs the complexity of target set selection. Discrete Optim. doi: 10.1016\/j.disopt.2010.09.007","journal-title":"Discrete Optim"},{"key":"9518_CR2","doi-asserted-by":"crossref","first-page":"1400","DOI":"10.1137\/08073617X","volume":"23","author":"N Chen","year":"2009","unstructured":"Chen N (2009) On the approximability of influence in social networks. SIAM J Discrete Math 23:1400\u20131415","journal-title":"SIAM J Discrete Math"},{"key":"9518_CR3","doi-asserted-by":"crossref","first-page":"1615","DOI":"10.1016\/j.dam.2008.09.012","volume":"157","author":"PA Dreyer Jr","year":"2009","unstructured":"Dreyer Jr PA, Roberts FS (2009) Irreversible k-threshold processes: graph-theoretical threshold models of the spread of disease and of opinion. Discrete Appl Math 157:1615\u20131627","journal-title":"Discrete Appl Math"},{"key":"9518_CR4","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF02992776","volume":"25","author":"GA Dirac","year":"1961","unstructured":"Dirac GA (1961) On rigid circuit graphs. Abh Math Semin Univ Hamb 25:71\u201376","journal-title":"Abh Math Semin Univ Hamb"},{"key":"9518_CR5","first-page":"57","volume-title":"Proc 7th ACM KDD","author":"P Domingos","year":"2001","unstructured":"Domingos P, Richardson M (2001) Mining the network value of customers. In: Proc 7th ACM KDD. ACM Press, New York, pp 57\u201366"},{"key":"9518_CR6","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. Discrete Appl Math 137:197\u2013212","journal-title":"Discrete Appl Math"},{"key":"9518_CR7","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"DR Fulkerson","year":"1965","unstructured":"Fulkerson DR, Gross OA (1965) Incidence matrices and interval graphs. Pac J Math 15:835\u2013855","journal-title":"Pac J Math"},{"key":"9518_CR8","volume-title":"Product graphs: structure and recognition","author":"W Imrich","year":"2000","unstructured":"Imrich W, Klav\u017ear S (2000) Product graphs: structure and recognition. Wiley, New York"},{"key":"9518_CR9","first-page":"137","volume-title":"Proc 9th ACM KDD","author":"D Kempe","year":"2003","unstructured":"Kempe D, Kleinberg J, Tardos E (2003) Maximizing the spread of influence through a social network. In: Proc 9th ACM KDD. ACM Press, New York, pp 137\u2013146"},{"key":"9518_CR10","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. Theor Comput Sci 282:231\u2013257","journal-title":"Theor Comput Sci"},{"key":"9518_CR11","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"DJ Rose","year":"1976","unstructured":"Rose DJ, Tarjan RE, Lueker GS (1976) Algorithmic aspects of vertex elimination on graphs. SIAM J Comput 5:266\u2013283","journal-title":"SIAM J Comput"},{"key":"9518_CR12","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"RE Tarjan","year":"1984","unstructured":"Tarjan RE, Yannakakis M (1984) Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J Comput 13:566\u2013579","journal-title":"SIAM J Comput"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9518-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-012-9518-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9518-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:18Z","timestamp":1559276598000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-012-9518-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,29]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["9518"],"URL":"https:\/\/doi.org\/10.1007\/s10878-012-9518-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6,29]]}}}