{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:53:30Z","timestamp":1743000810150,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319604374"},{"type":"electronic","value":"9783319604381"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-60438-1_12","type":"book-chapter","created":{"date-parts":[[2017,6,13]],"date-time":"2017-06-13T00:13:43Z","timestamp":1497312823000},"page":"116-126","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An Accurate and Efficient Method to Detect Critical Links to Maintain Information Flow in Network"],"prefix":"10.1007","author":[{"given":"Kazumi","family":"Saito","sequence":"first","affiliation":[]},{"given":"Kouzou","family":"Ohara","sequence":"additional","affiliation":[]},{"given":"Masahiro","family":"Kimura","sequence":"additional","affiliation":[]},{"given":"Hiroshi","family":"Motoda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,14]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","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":"12_CR2","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"},{"issue":"4","key":"12_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2200\/S00527ED1V01Y201308DTM037","volume":"5","author":"W Chen","year":"2013","unstructured":"Chen, W., Lakshmanan, L., Castillo, C.: Information and influence propagation in social networks. Synth. Lect. Data Manag. 5(4), 1\u2013177 (2013)","journal-title":"Synth. Lect. Data Manag."},{"key":"12_CR4","doi-asserted-by":"publisher","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":"12_CR5","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 Information and Knowledge Management, pp. 629\u2013638 (2014)","DOI":"10.1145\/2661829.2662077"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"105","DOI":"10.4086\/toc.2015.v011a004","volume":"11","author":"D Kempe","year":"2015","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. Theory Comput. 11, 105\u2013147 (2015)","journal-title":"Theory Comput."},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"9:1","DOI":"10.1145\/1514888.1514892","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. Discov. Data 3, 9:1\u20139:23 (2009)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"12_CR8","doi-asserted-by":"publisher","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":"12_CR9","doi-asserted-by":"publisher","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":"12_CR10","doi-asserted-by":"crossref","unstructured":"Saito, K., Kimura, M., Ohara, K., Motoda, H.: Detecting critical links in complex network to maintain information flow\/reachability. In: Proceedings of the 14th Pacific Rim International Conference on Artificial Intelligence, pp. 419\u2013432 (2016)","DOI":"10.1007\/978-3-319-42911-3_35"},{"key":"12_CR11","doi-asserted-by":"publisher","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. U. S. A. 99, 5766\u20135771 (2002)","journal-title":"Proc. Natl. Acad. Sci. U. S. A."}],"container-title":["Lecture Notes in Computer Science","Foundations of Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-60438-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:39:27Z","timestamp":1710232767000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-60438-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319604374","9783319604381"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-60438-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"14 June 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISMIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Methodologies for Intelligent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ismis2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ismis2017.ii.pw.edu.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}