乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T00:18:09Z","timestamp":1712362689749},"reference-count":16,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T00:00:00Z","timestamp":1688169600000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1016\/j.disc.2019.04.006","type":"journal-article","created":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T13:25:45Z","timestamp":1556889945000},"page":"2127-2133","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives"],"prefix":"10.1016","volume":"342","author":[{"given":"Christoph","family":"Brause","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Ehard","sequence":"additional","affiliation":[]},{"given":"Dieter","family":"Rautenbach","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.disc.2019.04.006_b1","doi-asserted-by":"crossref","first-page":"4017","DOI":"10.1016\/j.tcs.2010.08.021","article-title":"Combinatorial model and bounds for target set selection","volume":"411","author":"Ackerman","year":"2010","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.disc.2019.04.006_b2","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF01788542","article-title":"Large induced degenerate subgraphs","volume":"3","author":"Alon","year":"1987","journal-title":"Graphs Combin."},{"key":"10.1016\/j.disc.2019.04.006_b3","series-title":"The Probabilistic Method","author":"Alon","year":"2008"},{"key":"10.1016\/j.disc.2019.04.006_b4","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1016\/j.dam.2012.10.001","article-title":"A new lower bound on the independence number of graphs","volume":"161","author":"Angel","year":"2013","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.disc.2019.04.006_b5","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1080\/00029890.2000.12005203","article-title":"A better bound on the variance","volume":"107","author":"Bhatia","year":"2000","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/j.disc.2019.04.006_b6","series-title":"New results on the independence number","author":"Caro","year":"1979"},{"key":"10.1016\/j.disc.2019.04.006_b7","doi-asserted-by":"crossref","first-page":"1400","DOI":"10.1137\/08073617X","article-title":"On the approximability of influence in social networks","volume":"23","author":"Chen","year":"2009","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.disc.2019.04.006_b8","article-title":"Whom to befriend to influence people","author":"Cordasco","year":"2019","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.disc.2019.04.006_b9","doi-asserted-by":"crossref","first-page":"1804","DOI":"10.1007\/s00453-017-0390-5","article-title":"Discovering small target sets in social networks: a fast and effective algorithm","volume":"80","author":"Cordasco","year":"2018","journal-title":"Algorithmica"},{"key":"10.1016\/j.disc.2019.04.006_b10","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/978-3-319-25258-2_9","article-title":"Optimizing spread of influence in social networks via partial incentives","volume":"9439","author":"Cordasco","year":"2015","journal-title":"Lecture Notes in Comput. Sci."},{"key":"10.1016\/j.disc.2019.04.006_b11","doi-asserted-by":"crossref","DOI":"10.7151\/dmgt.2100","article-title":"On Selkow\u2019s bound on the independence number of graphs","author":"Harant","year":"2019","journal-title":"Discuss. Math. Graph Theory"},{"key":"10.1016\/j.disc.2019.04.006_b12","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.dam.2010.08.029","article-title":"Independence in connected graphs","volume":"159","author":"Harant","year":"2011","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.disc.2019.04.006_b13","doi-asserted-by":"crossref","first-page":"1812","DOI":"10.1016\/j.disc.2012.01.016","article-title":"New bounds for contagious sets","volume":"312","author":"Reichman","year":"2012","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2019.04.006_b14","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0012-365X(93)00102-B","article-title":"A probabilistic lower bound on the independence number of graphs","volume":"132","author":"Selkow","year":"1994","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2019.04.006_b15","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/0095-8956(91)90080-4","article-title":"A note on the independence number of triangle-free graphs, II","volume":"53","author":"Shearer","year":"1991","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.disc.2019.04.006_b16","series-title":"A Lower Bound on the Stability Number of a Simple Graph","author":"Wei","year":"1981"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X19301256?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X19301256?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T06:37:39Z","timestamp":1712299059000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X19301256"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":16,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["S0012365X19301256"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2019.04.006","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2019,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2019.04.006","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}