{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:13:27Z","timestamp":1725862407193},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319429106"},{"type":"electronic","value":"9783319429113"}],"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-319-42911-3_35","type":"book-chapter","created":{"date-parts":[[2016,8,9]],"date-time":"2016-08-09T00:01:34Z","timestamp":1470700894000},"page":"419-432","source":"Crossref","is-referenced-by-count":18,"title":["Detecting Critical Links in Complex Network to Maintain Information Flow\/Reachability"],"prefix":"10.1007","author":[{"given":"Kazumi","family":"Saito","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masahiro","family":"Kimura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kouzou","family":"Ohara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Motoda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,10]]},"reference":[{"key":"35_CR1","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1038\/35019019","volume":"406","author":"R Albert","year":"2000","unstructured":"Albert, R., Jeong, H., Barab\u00e1si, A.L.: Error and attack tolerance of complex networks. Nature 406, 378\u2013382 (2000)","journal-title":"Nature"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: In-core computation of geometric centralities with hyperball: a hunderd billion nodes and beyond. In: Proceedings of the 2013 IEEE 13th International Conference on Data Mining Workshops (ICDMW 2013), pp. 621\u2013628 (2013)","DOI":"10.1109\/ICDMW.2013.10"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"Borgs, C., Brautbar, M., Chayes, J., Lucier, B.: Maximizing social influence in nearly optimal time. In: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014), pp. 946\u2013957 (2014)","DOI":"10.1137\/1.9781611973402.70"},{"key":"35_CR4","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Comput. Netw. ISDN Syst. 30, 107\u2013117 (1998)","journal-title":"Comput. Netw. ISDN Syst."},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J.: Graph structure in the web. In: Proceedings of the 9th International World Wide Web Conference, pp. 309\u2013320 (2000)","DOI":"10.1016\/S1389-1286(00)00083-9"},{"key":"35_CR6","doi-asserted-by":"crossref","first-page":"5468","DOI":"10.1103\/PhysRevLett.85.5468","volume":"85","author":"DS Callaway","year":"2000","unstructured":"Callaway, D.S., Newman, M.E.J., Strogatz, S.H., Watts, D.J.: Network robustness and fragility: percolation on random graphs. Phys. Rev. Lett. 85, 5468\u20135471 (2000)","journal-title":"Phys. Rev. Lett."},{"key":"35_CR7","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1109\/2.781636","volume":"32","author":"S Chakrabarti","year":"1999","unstructured":"Chakrabarti, S., Dom, B., Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A., Gibson, D., Kleinberg, J.: Mining the web\u2019s link structure. IEEE Comput. 32, 60\u201367 (1999)","journal-title":"IEEE Comput."},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2009), pp. 199\u2013208 (2009)","DOI":"10.1145\/1557019.1557047"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Chen, W., Yuan, Y., Zhang, L.: Scalable influence maximization in social networks under the linear threshold model. In: Proceedings of the 10th IEEE International Conference on Data Mining (ICDM 2010), pp. 88\u201397 (2010)","DOI":"10.1109\/ICDM.2010.118"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Chierichetti, F., Epasto, A., Kumar, R., Lattanzi, S., Mirrokni, V.: Efficient algorithms for public-private social networks. In: Proceedings of the 21st ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2015), pp. 139\u2013148 (2015)","DOI":"10.1145\/2783258.2783354"},{"key":"35_CR11","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1006\/jcss.1997.1534","volume":"55","author":"E Cohen","year":"1997","unstructured":"Cohen, E.: Size-estimation framework with applications to transitive closure and reachability. J. Comput. Syst. Sci. 55, 441\u2013453 (1997)","journal-title":"J. Comput. Syst. Sci."},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"Cohen, E.: All-distances sketches, revisited: HIP estimators for massive graphs analysis. In: Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 88\u201399 (2015)","DOI":"10.1109\/TKDE.2015.2411606"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"Cohen, E., Delling, D., Pajor, T., Werneck, R.F.: Sketch-based influence maximization and computation: scaling up with guarantees. In: Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, pp. 629\u2013638 (2014)","DOI":"10.1145\/2661829.2662077"},{"key":"35_CR14","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"L Freeman","year":"1979","unstructured":"Freeman, L.: Centrality in social networks: conceptual clarification. Soc. Netw. 1, 215\u2013239 (1979)","journal-title":"Soc. Netw."},{"issue":"1","key":"35_CR15","doi-asserted-by":"crossref","first-page":"73","DOI":"10.14778\/2047485.2047492","volume":"5","author":"A Goyal","year":"2011","unstructured":"Goyal, A., Bonchi, F., Lakshmanan, L.: A data-based approach to social influence maximization. Proc. VLDB Endowment 5(1), 73\u201384 (2011)","journal-title":"Proc. VLDB Endowment"},{"key":"35_CR16","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2003), pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"key":"35_CR17","first-page":"9:1","volume":"3","author":"M Kimura","year":"2009","unstructured":"Kimura, M., Saito, K., Motoda, H.: Blocking links to minimize contamination spread in a social network. ACM Trans. Knowl. Disc. Data 3, 9:1\u20139:23 (2009)","journal-title":"ACM Trans. Knowl. Disc. Data"},{"key":"35_CR18","unstructured":"Kimura, M., Saito, K., Nakano, R.: Extracting influential nodes for information diffusion on a social network. In: Proceedings of the 22nd AAAI Conference on Artificial Intelligence (AAAI 2007), pp. 1371\u20131376 (2007)"},{"key":"35_CR19","doi-asserted-by":"crossref","unstructured":"Kimura, M., Saito, K., Ohara, K., Motoda, H.: Efficient analysis of node influence based on sir model over huge complex networks. In: Proceedings of the 2014 International Conference on Data Science and Advanced Analytics (DSAA 2014), pp. 216\u2013222 (2014)","DOI":"10.1109\/DSAA.2014.7058076"},{"key":"35_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s41060-015-0001-y","volume":"1","author":"M Kimura","year":"2016","unstructured":"Kimura, M., Saito, K., Ohara, K., Motoda, H.: Speeding-up node influence computation for huge social networks. Int. J. Data Sci. Anal. 1, 1\u201314 (2016)","journal-title":"Int. J. Data Sci. Anal."},{"key":"35_CR21","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2007), pp. 420\u2013429 (2007)","DOI":"10.1145\/1281192.1281239"},{"key":"35_CR22","doi-asserted-by":"crossref","first-page":"035101","DOI":"10.1103\/PhysRevE.66.035101","volume":"66","author":"MEJ Newman","year":"2002","unstructured":"Newman, M.E.J., Forrest, S., Balthrop, J.: Email networks and the spread of computer viruses. Phys. Rev. E 66, 035101 (2002)","journal-title":"Phys. Rev. E"},{"key":"35_CR23","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"M Newman","year":"2003","unstructured":"Newman, M.: The structure and function of complex networks. SIAM Rev. 45, 167\u2013256 (2003)","journal-title":"SIAM Rev."},{"key":"35_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1007\/978-3-319-11812-3_20","volume-title":"Discovery Science","author":"K Ohara","year":"2014","unstructured":"Ohara, K., Saito, K., Kimura, M., Motoda, H.: Resampling-based framework for estimating node centrality of large social network. In: D\u017eeroski, S., Panov, P., Kocev, D., Todorovski, L. (eds.) DS 2014. LNCS, vol. 8777, pp. 228\u2013239. Springer, Heidelberg (2014)"},{"key":"35_CR25","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1016\/j.ins.2015.03.034","volume":"329","author":"K Saito","year":"2016","unstructured":"Saito, K., Kimura, M., Ohara, K., Motoda, H.: Super mediator - a new centrality measure of node importance for information diffusion over social network. Inf. Sci. 329, 985\u20131000 (2016)","journal-title":"Inf. Sci."},{"key":"35_CR26","doi-asserted-by":"crossref","first-page":"1379","DOI":"10.1109\/TPDS.2014.2320515","volume":"26","author":"G Song","year":"2015","unstructured":"Song, G., Zhou, X., Wang, Y., Xie, K.: Influence maximization on large-scale mobile social network: a divide-and-conquer method. IEEE Trans. Parallel Distrib. Syst. 26, 1379\u20131392 (2015)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"35_CR27","doi-asserted-by":"crossref","first-page":"5766","DOI":"10.1073\/pnas.082090499","volume":"99","author":"D Watts","year":"2002","unstructured":"Watts, D.: A simple model of global cascades on random networks. Proc. Natl. Acad. Sci. USA. 99, 5766\u20135771 (2002)","journal-title":"Proc. Natl. Acad. Sci. USA."},{"key":"35_CR28","doi-asserted-by":"crossref","first-page":"2770","DOI":"10.1109\/TKDE.2015.2419659","volume":"27","author":"C Zhou","year":"2015","unstructured":"Zhou, C., Zhang, P., Zang, W., Guo, L.: On the upper bounds of spread for greedy algorithms in social network influence maximization. IEEE Trans. Knowl. Data Eng. 27, 2770\u20132783 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["Lecture Notes in Computer Science","PRICAI 2016: Trends in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42911-3_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T16:14:35Z","timestamp":1498320875000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42911-3_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319429106","9783319429113"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42911-3_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}