乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:21:51Z","timestamp":1740097311314,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662531730"},{"type":"electronic","value":"9783662531747"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53174-7_13","type":"book-chapter","created":{"date-parts":[[2016,8,4]],"date-time":"2016-08-04T14:50:06Z","timestamp":1470322206000},"page":"169-185","source":"Crossref","is-referenced-by-count":0,"title":["The Maximum Time of 2-neighbour Bootstrap Percolation in Grid Graphs and Parametrized Results"],"prefix":"10.1007","author":[{"given":"Thiago","family":"Marcilon","sequence":"first","affiliation":[]},{"given":"Rudini","family":"Sampaio","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,5]]},"reference":[{"issue":"3","key":"13_CR1","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s10955-010-0056-z","volume":"141","author":"H Amini","year":"2010","unstructured":"Amini, H.: Bootstrap percolation in living neural networks. J. Stat. Phys. 141(3), 459\u2013475 (2010)","journal-title":"J. Stat. Phys."},{"key":"13_CR2","unstructured":"Ara\u00fajo, R., Sampaio, R., Santos, V., Szwarcfiter, J.: The convexity of induced paths of order three and applications: complexity aspects. Discrete Appl. Math. (2015, to appear)"},{"key":"13_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0166-218X(97)90120-7","volume":"84","author":"L Babel","year":"1998","unstructured":"Babel, L., Olariu, S.: On the structure of graphs with few $$P_4$$ \u2019s. Discrete Appl. Math. 84, 1\u201313 (1998)","journal-title":"Discrete Appl. Math."},{"key":"13_CR4","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0012-365X(00)00258-2","volume":"235","author":"L Babel","year":"2001","unstructured":"Babel, L., Kloks, T., Kratochv\u00edl, J., Kratsch, D., M\u00fcller, H., Olariu, S.: Efficient algorithms for graphs with few $$P_4$$ \u2019s. Discrete Math. 235, 29\u201351 (2001)","journal-title":"Discrete Math."},{"issue":"5","key":"13_CR5","doi-asserted-by":"crossref","first-page":"2667","DOI":"10.1090\/S0002-9947-2011-05552-2","volume":"364","author":"J Balogh","year":"2012","unstructured":"Balogh, J., Bollob\u00e1s, B., Duminil-Copin, H., Morris, R.: The sharp threshold for bootstrap percolation in all dimensions. Trans. Amer. Math. Soc. 364(5), 2667\u20132701 (2012)","journal-title":"Trans. Amer. Math. Soc."},{"key":"13_CR6","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1002\/(SICI)1098-2418(199810\/12)13:3\/4<409::AID-RSA11>3.0.CO;2-U","volume":"13","author":"J Balogh","year":"1998","unstructured":"Balogh, J., Pete, G.: Random disease on the square grid. Random Struct. Algorithms 13, 409\u2013422 (1998)","journal-title":"Random Struct. Algorithms"},{"issue":"4","key":"13_CR7","doi-asserted-by":"crossref","first-page":"1329","DOI":"10.1214\/08-AOP433","volume":"37","author":"J Balogh","year":"2009","unstructured":"Balogh, J., Bollob\u00e1s, B., Morris, R.: Bootstrap percolation in three dimensions. Ann. Probab. 37(4), 1329\u20131380 (2009)","journal-title":"Ann. Probab."},{"issue":"5\u20136","key":"13_CR8","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1017\/S0963548310000271","volume":"19","author":"J Balogh","year":"2010","unstructured":"Balogh, J., Bollob\u00e1s, B., Morris, R.: Bootstrap percolation in high dimensions. Combin. Probab. Comput. 19(5\u20136), 643\u2013692 (2010)","journal-title":"Combin. Probab. Comput."},{"key":"13_CR9","unstructured":"Baumann, S.: A linear algorithm for the homogeneous decomposition of graphs. Report No. M-9615, Zentrum Mathematik. Technische Universit\u00e4t M\u00fcnchen (1996)"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Benevides, F., Campos, V., Dourado, M.C., Sampaio, R.M., Silva, A.: The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects. In: The Seventh European Conference on Combinatorics, Graph Theory and Applications, Series CRM, vol. 16, pp. 135\u2013139. Scuola Normale Superiore (2013)","DOI":"10.1007\/978-88-7642-475-5_22"},{"key":"13_CR11","unstructured":"Benevides, F., Przykucki, M.: Maximum percolation time in two-dimensional bootstrap percolation. Submitted (2014). http:\/\/arxiv.org\/abs\/1310.4457v1"},{"issue":"2","key":"13_CR12","doi-asserted-by":"crossref","first-page":"46","DOI":"10.37236\/2542","volume":"20","author":"F Benevides","year":"2013","unstructured":"Benevides, F., Przykucki, M.: On slowly percolating sets of minimal size in bootstrap percolation. Electron. J. Comb. 20(2), 46 (2013)","journal-title":"Electron. J. Comb."},{"issue":"4","key":"13_CR13","doi-asserted-by":"crossref","first-page":"1337","DOI":"10.1214\/12-AOP818","volume":"42","author":"B Bollob\u00e1s","year":"2014","unstructured":"Bollob\u00e1s, B., Holmgren, C., Smith, P.J., Uzzell, A.J.: The time of bootstrap percolation with dense initial sets. Ann. Probab. 42(4), 1337\u20131373 (2014)","journal-title":"Ann. Probab."},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Campos, V., Sampaio, R., Silva, A., Szwarcfiter, J.: Graphs with few P4s under the convexity of paths of order three. Discrete Appl. Math. (2015, to appear). http:\/\/dx.doi.org\/10.1016\/j.dam.2014.05.005","DOI":"10.1016\/j.dam.2014.05.005"},{"issue":"1","key":"13_CR15","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1088\/0022-3719\/12\/1\/008","volume":"12","author":"J Chalupa","year":"1979","unstructured":"Chalupa, J., Leath, P.L., Reich, G.R.: Bootstrap percolation on a Bethe lattice. J. Phys. C 12(1), 31\u201335 (1979)","journal-title":"J. Phys. C"},{"issue":"3","key":"13_CR16","doi-asserted-by":"crossref","first-page":"1400","DOI":"10.1137\/08073617X","volume":"23","author":"N Chen","year":"2009","unstructured":"Chen, N.: On the approximability of influence in social networks. SIAM J. Discrete Math. 23(3), 1400\u20131415 (2009)","journal-title":"SIAM J. Discrete Math."},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/978-3-319-08001-7_9","volume-title":"Approximation and Online Algorithms","author":"EMM Coelho","year":"2014","unstructured":"Coelho, E.M.M., Dourado, M.C., Sampaio, R.M.: Inapproximability results for graph convexity parameters. In: Kaklamanis, C., Pruhs, K. (eds.) WAOA 2013. LNCS, vol. 8447, pp. 97\u2013107. Springer, Heidelberg (2014)"},{"key":"13_CR18","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0166-218X(00)00221-3","volume":"108","author":"B Courcelle","year":"2001","unstructured":"Courcelle, B., Makowsky, J., Rotics, U.: On the fixed parameter complexity of graph enumeration problems definable in monadic second order logic. Discrete Appl. Math. 108, 23\u201352 (2001)","journal-title":"Discrete Appl. Math."},{"issue":"7","key":"13_CR19","doi-asserted-by":"crossref","first-page":"1615","DOI":"10.1016\/j.dam.2008.09.012","volume":"157","author":"PA Dreyer","year":"2009","unstructured":"Dreyer, P.A., Roberts, F.S.: Irreversible k-threshold processes: graph-theoretical threshold models of the spread of disease and of opinion. Discrete Appl. Math. 157(7), 1615\u20131627 (2009)","journal-title":"Discrete Appl. Math."},{"key":"13_CR20","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s10955-009-9899-6","volume":"138","author":"A Fey","year":"2010","unstructured":"Fey, A., Levine, L., Peres, Y.: Growth rates and explosions in sandpiles. J. Stat. Phys. 138, 143\u2013159 (2010)","journal-title":"J. Stat. Phys."},{"key":"13_CR21","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2010","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2010)"},{"issue":"2","key":"13_CR22","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s00440-002-0239-x","volume":"125","author":"AE Holroyd","year":"2003","unstructured":"Holroyd, A.E.: Sharp metastability threshold for two-dimensional bootstrap percolation. Probab. Theor. Relat. Fields 125(2), 195\u2013224 (2003)","journal-title":"Probab. Theor. Relat. Fields"},{"key":"13_CR23","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1137\/0211056","volume":"11","author":"A Itai","year":"1982","unstructured":"Itai, A., Papadimitriou, C.H., Szwarcfiter, J.L.: Paths in grid graphs. SIAM J. Comput. 11, 676\u2013686 (1982)","journal-title":"SIAM J. Comput."},{"key":"13_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1007\/978-3-319-12340-0_31","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"T Marcilon","year":"2014","unstructured":"Marcilon, T., Nascimento, S., Sampaio, R.: The maximum time of 2-neighbour bootstrap percolation: complexity results. In: Kratsch, D., Todinca, I. (eds.) WG 2014. LNCS, vol. 8747, pp. 372\u2013383. Springer, Heidelberg (2014)"},{"issue":"1","key":"13_CR25","first-page":"20","volume":"16","author":"R Morris","year":"2009","unstructured":"Morris, R.: Minimal percolating sets in bootstrap percolation. Electron. J. Comb. 16(1), 20 (2009)","journal-title":"Electron. J. Comb."},{"issue":"2","key":"13_CR26","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0196-6774(84)90029-4","volume":"5","author":"CH Papadimitriou","year":"1984","unstructured":"Papadimitriou, C.H., Vazirani, U.V.: On two geometric problems related to the travelling salesman problem. J. Algorithms 5(2), 231\u2013246 (1984)","journal-title":"J. Algorithms"},{"issue":"2","key":"13_CR27","doi-asserted-by":"crossref","first-page":"41","DOI":"10.37236\/2412","volume":"19","author":"M Przykucki","year":"2012","unstructured":"Przykucki, M.: Maximal percolation time in hypercubes under 2-bootstrap percolation. Electron. J. Comb. 19(2), 41 (2012)","journal-title":"Electron. J. Comb."},{"issue":"1","key":"13_CR28","first-page":"13","volume":"17","author":"E Riedl","year":"2010","unstructured":"Riedl, E.: Largest minimal percolating sets in hypercubes under 2-bootstrap percolation. Electron. J. Comb. 17(1), 13 (2010)","journal-title":"Electron. J. Comb."},{"issue":"1","key":"13_CR29","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0166-218X(84)90081-7","volume":"8","author":"CA Tovey","year":"1984","unstructured":"Tovey, C.A.: A simplified NP-complete satisfiability problem. Discrete Appl. Math. 8(1), 85\u201389 (1984)","journal-title":"Discrete Appl. Math."},{"key":"13_CR30","doi-asserted-by":"crossref","unstructured":"Umans, C., Lenhart, W.: Hamiltonian cycles in solid grid graphs. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS), 1997, Miami, USA, pp. 496\u2013505. IEEE Computer Society, Washington, DC (1997)","DOI":"10.1109\/SFCS.1997.646138"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53174-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,24]],"date-time":"2020-09-24T19:47:54Z","timestamp":1600976874000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53174-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662531730","9783662531747"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53174-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}