{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T16:38:46Z","timestamp":1725986326295},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319973036"},{"type":"electronic","value":"9783319973043"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-97304-3_22","type":"book-chapter","created":{"date-parts":[[2018,7,26]],"date-time":"2018-07-26T14:34:06Z","timestamp":1532615646000},"page":"282-295","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Detection of Critical Links to Maintain Performance of Network with Uncertain Connectivity"],"prefix":"10.1007","author":[{"given":"Kazumi","family":"Saito","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kouzou","family":"Ohara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masahiro","family":"Kimura","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":[[2018,7,27]]},"reference":[{"key":"22_CR1","first-page":"946","volume-title":"Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Christian Borgs","year":"2013","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)"},{"issue":"4","key":"22_CR2","first-page":"298","volume":"4","author":"K Burckhart","year":"2012","unstructured":"Burckhart, K., Martin, O.J.: An interpretation of the recent evolution of the city of Barcelona through the traffic maps. J. Geograph. Inf. Syst. 4(4), 298\u2013311 (2012)","journal-title":"J. Geograph. Inf. Syst."},{"key":"22_CR3","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"},{"issue":"3","key":"22_CR4","doi-asserted-by":"publisher","first-page":"036125","DOI":"10.1103\/PhysRevE.73.036125","volume":"73","author":"P Crucitti","year":"2006","unstructured":"Crucitti, P., Latora, V., Porta, S.: Centrality measures in spatial networks of urban streets. Phys. Rev. E 73(3), 036125 (2006)","journal-title":"Phys. Rev. E"},{"key":"22_CR5","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":"22_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-319-46307-0_24","volume-title":"Discovery Science","author":"K Ohara","year":"2016","unstructured":"Ohara, K., Saito, K., Kimura, M., Motoda, H.: Accelerating computation of distance based centrality measures for spatial networks. In: Calders, T., Ceci, M., Malerba, D. (eds.) DS 2016. LNCS (LNAI), vol. 9956, pp. 376\u2013391. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-46307-0_24"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Ohara, K., Saito, K., Kimura, M., Motoda, H.: Maximizing network performance based on group centrality by creating most effective k-links. In: Proceedings of the 4th IEEE International Conference on Data Science and Advanced Analytics (DSAA 2017), pp. 561\u2013570 (2017)","DOI":"10.1109\/DSAA.2017.44"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.sbspro.2014.12.196","volume":"162","author":"EL Oliveira","year":"2014","unstructured":"Oliveira, E.L., Portugal, L.S., Junior, W.P.: Determining critical links in a road network: vulnerability and congestion indicators. Procedia - Soc. Behav. Sci. 162, 158\u2013167 (2014)","journal-title":"Procedia - Soc. Behav. Sci."},{"issue":"3","key":"22_CR9","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.socnet.2010.03.006","volume":"32","author":"T Opsahl","year":"2010","unstructured":"Opsahl, T., Agneessens, F., Skvoretz, J.: Node centrality in weighted networks: generalizing degree and shortest paths. Soc. Netw. 32(3), 245\u2013251 (2010)","journal-title":"Soc. Netw."},{"issue":"2","key":"22_CR10","first-page":"12","volume":"10","author":"M Papagelis","year":"2015","unstructured":"Papagelis, M.: Refining social graph connectivity via shortcut edge addition. ACM Trans. Knowl. Discov. Data (TKDD) 10(2), 12 (2015)","journal-title":"ACM Trans. Knowl. Discov. Data (TKDD)"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Parotsidis, N., Pitoura, E., Tsaparas, P.: Centrality-aware link recommendations. In: Proceedings of of the Ninth ACM International Conference on Web Search and Data Mining (WSDM 2016), pp. 503\u2013512 (2016)","DOI":"10.1145\/2835776.2835818"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-319-42911-3_35","volume-title":"PRICAI 2016: Trends in Artificial Intelligence","author":"K Saito","year":"2016","unstructured":"Saito, K., Kimura, M., Ohara, K., Motoda, H.: Detecting critical links in complex network to maintain information flow\/reachability. In: Booth, R., Zhang, M.-L. (eds.) PRICAI 2016. LNCS (LNAI), vol. 9810, pp. 419\u2013432. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-42911-3_35"},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-319-60438-1_12","volume-title":"Foundations of Intelligent Systems","author":"K Saito","year":"2017","unstructured":"Saito, K., Ohara, K., Kimura, M., Motoda, H.: An accurate and efficient method to detect critical links to maintain information flow in network. In: Kryszkiewicz, M., Appice, A., \u015al\u0119zak, D., Rybinski, H., Skowron, A., Ra\u015b, Z.W. (eds.) ISMIS 2017. LNCS (LNAI), vol. 10352, pp. 116\u2013126. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-60438-1_12"},{"issue":"3","key":"22_CR14","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1109\/TNET.2012.2215882","volume":"21","author":"Y Shen","year":"2013","unstructured":"Shen, Y., Nguyen, N.P., Xuan, Y., Thai, M.T.: On the discovery of critical links and nodes for assessing network vulnerability. IEEE\/ACM Trans. Netw. 21(3), 963\u2013973 (2013)","journal-title":"IEEE\/ACM Trans. Netw."}],"container-title":["Lecture Notes in Computer Science","PRICAI 2018: Trends in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-97304-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,26]],"date-time":"2018-07-26T14:48:20Z","timestamp":1532616500000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-97304-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319973036","9783319973043"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-97304-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}