{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,12]],"date-time":"2025-07-12T01:18:51Z","timestamp":1752283131394,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031703645"},{"type":"electronic","value":"9783031703652"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-70365-2_17","type":"book-chapter","created":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T04:01:55Z","timestamp":1725163315000},"page":"287-302","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Introducing Total Harmonic Resistance for\u00a0Graph Robustness Under Edge Deletions"],"prefix":"10.1007","author":[{"given":"Lukas","family":"Berner","sequence":"first","affiliation":[]},{"given":"Henning","family":"Meyerhenke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,22]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Albert, R., Jeong, H., Barab\u00e1si, A.L.: Error and attack tolerance of complex networks. Nature 406(6794), 378\u2013382 (2000)","DOI":"10.1038\/35019019"},{"key":"17_CR2","doi-asserted-by":"publisher","unstructured":"Angriman, E., Becker, R., D\u2019Angelo, G., Gilbert, H., van\u00a0der Grinten, A., Meyerhenke, H.: Group-harmonic and group-closeness maximization - approximation and engineering. In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX, pp. 154\u2013168. SIAM (2021). https:\/\/doi.org\/10.1137\/1.9781611976472.12","DOI":"10.1137\/1.9781611976472.12"},{"key":"17_CR3","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-031-21534-6_1","volume-title":"Algorithms for Big Data","author":"E Angriman","year":"2022","unstructured":"Angriman, E., van der Grinten, A., Hamann, M., Meyerhenke, H., Penschuck, M.: Algorithms for large-scale network analysis and the networkit toolkit. In: Bast, H., Korzen, C., Meyer, U., Penschuck, M. (eds.) Algorithms for Big Data. LNCS, vol. 13201, pp. 3\u201320. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-21534-6_1"},{"issue":"7","key":"17_CR4","doi-asserted-by":"publisher","first-page":"127","DOI":"10.3390\/a12070127","volume":"12","author":"E Angriman","year":"2019","unstructured":"Angriman, E., et al.: Guidelines for experimental algorithmics: a case study in network analysis. Algorithms 12(7), 127 (2019). https:\/\/doi.org\/10.3390\/a12070127","journal-title":"Algorithms"},{"key":"17_CR5","volume-title":"Network Science","author":"AL Barab\u00e1si","year":"2016","unstructured":"Barab\u00e1si, A.L., P\u00f3sfai, M.: Network Science. Cambridge University Press, Cambridge (2016)"},{"key":"17_CR6","doi-asserted-by":"publisher","unstructured":"Beygelzimer, A., Grinstein, G., Linsker, R., Rish, I.: Improving network robustness by edge modification. Physica A 357(3), 593\u2013612 (2005). https:\/\/doi.org\/10.1016\/j.physa.2005.03.040. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0378437105003523","DOI":"10.1016\/j.physa.2005.03.040"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.compenvurbsys.2017.05.004","volume":"65","author":"G Boeing","year":"2017","unstructured":"Boeing, G.: OSMnx: new methods for acquiring, constructing, analyzing, and visualizing complex street networks. Comput. Environ. Urban Syst. 65, 126\u2013139 (2017)","journal-title":"Comput. Environ. Urban Syst."},{"issue":"3","key":"17_CR8","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1016\/j.socnet.2013.05.003","volume":"35","author":"E Bozzo","year":"2013","unstructured":"Bozzo, E., Franceschet, M.: Resistance distance, closeness, and betweenness. Soc. Netw. 35(3), 460\u2013469 (2013). https:\/\/doi.org\/10.1016\/j.socnet.2013.05.003","journal-title":"Soc. Netw."},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1016\/j.ress.2017.07.009","volume":"167","author":"O Cats","year":"2017","unstructured":"Cats, O., Koppenol, G.J., Warnier, M.: Robustness assessment of link capacity reduction for complex networks: application for public transport systems. Reliab. Eng. Syst. Saf. 167, 544\u2013553 (2017)","journal-title":"Reliab. Eng. Syst. Saf."},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"1395","DOI":"10.1007\/s10618-015-0447-5","volume":"30","author":"H Chan","year":"2016","unstructured":"Chan, H., Akoglu, L.: Optimizing network robustness by edge rewiring: a general framework. Data Min. Knowl. Disc. 30, 1395\u20131425 (2016)","journal-title":"Data Min. Knowl. Disc."},{"key":"17_CR11","unstructured":"Chebotarev, P.Y., Shamis, E.: The forest metrics of a graph and their properties. Automation Remote Control C\/C of Avtomatika I Telemekhanika 61(8; Issu 2), 1364\u20131373 (2000)"},{"issue":"10","key":"17_CR12","doi-asserted-by":"publisher","first-page":"2491","DOI":"10.1016\/j.laa.2011.02.024","volume":"435","author":"W Ellens","year":"2011","unstructured":"Ellens, W., Spieksma, F., Van Mieghem, P., Jamakovic, A., Kooij, R.: Effective graph resistance. Linear Algebra Appl. 435(10), 2491\u20132506 (2011)","journal-title":"Linear Algebra Appl."},{"issue":"6","key":"17_CR13","first-page":"5915","volume":"35","author":"S Freitas","year":"2022","unstructured":"Freitas, S., Yang, D., Kumar, S., Tong, H., Chau, D.H.: Graph vulnerability and robustness: a survey. IEEE Trans. Knowl. Data Eng. 35(6), 5915\u20135934 (2022)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"17_CR14","doi-asserted-by":"publisher","unstructured":"van\u00a0der Grinten, A., Angriman, E., Predari, M., Meyerhenke, H.: New approximation algorithms for forest closeness centrality - for individual vertices and vertex groups. In: Proceedings of the 2021 SIAM International Conference on Data Mining, SDM 2021, pp. 136\u2013144. SIAM (2021). https:\/\/doi.org\/10.1137\/1.9781611976700.16","DOI":"10.1137\/1.9781611976700.16"},{"issue":"1","key":"17_CR15","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/s41109-023-00556-5","volume":"8","author":"R Hasheminezhad","year":"2023","unstructured":"Hasheminezhad, R., Brandes, U.: Robustness of preferential-attachment graphs. Appl. Netw. Sci. 8(1), 32 (2023). https:\/\/doi.org\/10.1007\/s41109-023-00556-5","journal-title":"Appl. Netw. Sci."},{"key":"17_CR16","doi-asserted-by":"publisher","unstructured":"Jin, Y., Bao, Q., Zhang, Z.: Forest distance closeness centrality in disconnected graphs. In: 2019 IEEE International Conference on Data Mining (ICDM), pp. 339\u2013348. IEEE Computer Society (2019). https:\/\/doi.org\/10.1109\/ICDM.2019.00044. https:\/\/doi.ieeecomputersociety.org\/10.1109\/ICDM.2019.00044","DOI":"10.1109\/ICDM.2019.00044"},{"key":"17_CR17","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF01164627","volume":"12","author":"D Klein","year":"1993","unstructured":"Klein, D., Randic, M.: Resistance distance. J. Math. Chem. 12, 81\u201395 (1993). https:\/\/doi.org\/10.1007\/BF01164627","journal-title":"J. Math. Chem."},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Kooij, R.E., Achterberg, M.A.: Minimizing the effective graph resistance by adding links is NP-hard. arXiv preprint arXiv:2302.12628 (2023)","DOI":"10.1016\/j.orl.2023.10.002"},{"key":"17_CR19","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.physa.2014.07.083","volume":"415","author":"Y Ko\u00e7","year":"2014","unstructured":"Ko\u00e7, Y., Warnier, M., Van Mieghem, P., Kooij, R.E., Brazier, F.M.: A topological investigation of phase transitions of cascading failures in power grids. Phys. A 415, 273\u2013284 (2014)","journal-title":"Phys. A"},{"key":"17_CR20","doi-asserted-by":"publisher","unstructured":"Kunegis, J.: KONECT: the koblenz network collection. In: Carr, L., et al. (eds.) 22nd International World Wide Web Conference, WWW 2013, pp. 1343\u20131350. International World Wide Web Conferences Steering Committee\/ACM (2013). https:\/\/doi.org\/10.1145\/2487788.2488173","DOI":"10.1145\/2487788.2488173"},{"key":"17_CR21","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection (2014). http:\/\/snap.stanford.edu\/data"},{"issue":"4","key":"17_CR22","doi-asserted-by":"publisher","first-page":"1385","DOI":"10.1109\/TKDE.2023.3309987","volume":"36","author":"C Liu","year":"2024","unstructured":"Liu, C., Zhou, X., Zehmakan, A.N., Zhang, Z.: A fast algorithm for moderating critical nodes via edge removal. IEEE Trans. Knowl. Data Eng. 36(4), 1385\u20131398 (2024). https:\/\/doi.org\/10.1109\/TKDE.2023.3309987","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Mavroforakis, C., Garcia-Lebron, R., Koutis, I., Terzi, E.: Spanning edge centrality: Large-scale computation and applications. In: Proceedings of the 24th International Conference on World Wide Web, pp. 732\u2013742. International World Wide Web Conferences Steering Committee (2015)","DOI":"10.1145\/2736277.2741125"},{"key":"17_CR24","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/BFb0006528","volume-title":"Optimization Techniques","author":"M Minoux","year":"1978","unstructured":"Minoux, M.: Accelerated greedy algorithms for maximizing submodular set functions. In: Stoer, J. (ed.) Optimization Techniques, pp. 234\u2013243. Springer, Heidelberg (1978). https:\/\/doi.org\/10.1007\/BFb0006528"},{"issue":"3","key":"17_CR25","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1002\/net.3230190305","volume":"19","author":"M Minoux","year":"1989","unstructured":"Minoux, M.: Networks synthesis and optimum network design problems: models, solution methods and applications. Networks 19(3), 313\u2013360 (1989). https:\/\/doi.org\/10.1002\/net.3230190305","journal-title":"Networks"},{"key":"17_CR26","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198805090.001.0001","volume-title":"Networks","author":"M Newman","year":"2018","unstructured":"Newman, M.: Networks, 2nd edn. Oxford University Press, Oxford (2018)","edition":"2"},{"key":"17_CR27","doi-asserted-by":"publisher","unstructured":"Oehlers, M., Fabian, B.: Graph metrics for network robustness-a survey. Mathematics 9(8) (2021). https:\/\/doi.org\/10.3390\/math9080895. https:\/\/www.mdpi.com\/2227-7390\/9\/8\/895","DOI":"10.3390\/math9080895"},{"key":"17_CR28","unstructured":"OpenStreetMap contributors: OpenStreetMap database (2017). https:\/\/www.openstreetmap.org"},{"key":"17_CR29","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1007\/978-3-030-05411-3_64","volume-title":"Complex Networks and Their Applications VII","author":"C Pizzuti","year":"2019","unstructured":"Pizzuti, C., Socievole, A.: A genetic algorithm for enhancing the robustness of complex networks through link protection. In: Aiello, L.M., Cherifi, C., Cherifi, H., Lambiotte, R., Li\u00f3, P., Rocha, L.M. (eds.) COMPLEX NETWORKS 2018. SCI, vol. 812, pp. 807\u2013819. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-05411-3_64"},{"key":"17_CR30","doi-asserted-by":"crossref","unstructured":"Predari, M., Berner, L., Kooij, R., Meyerhenke, H.: Greedy optimization of resistance-based graph robustness with global and local edge insertions. Soc. Netw. Anal. Mining (2023, to appear). Also available as arXiv preprint 2309.08271","DOI":"10.1007\/s13278-023-01137-1"},{"key":"17_CR31","doi-asserted-by":"crossref","unstructured":"Predari, M., Kooij, R., Meyerhenke, H.: Faster greedy optimization of resistance-based graph robustness. In: IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2022, Istanbul, Turkey, 10\u201313 November 2022, pp.\u00a01\u20138. IEEE (2022)","DOI":"10.1109\/ASONAM55673.2022.10068613"},{"key":"17_CR32","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: AAAI (2015). http:\/\/networkrepository.com","DOI":"10.1609\/aaai.v29i1.9277"},{"issue":"2","key":"17_CR33","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s10922-016-9391-y","volume":"25","author":"DF Rueda","year":"2017","unstructured":"Rueda, D.F., Calle, E., Marzo, J.L.: Robustness comparison of 15 real telecommunication networks: Structural and centrality measurements. J. Netw. Syst. Manage. 25(2), 269\u2013289 (2017)","journal-title":"J. Netw. Syst. Manage."},{"issue":"1","key":"17_CR34","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1214\/aoms\/1177729893","volume":"21","author":"J Sherman","year":"1950","unstructured":"Sherman, J., Morrison, W.J.: Adjustment of an inverse matrix corresponding to a change in one element of a given matrix. Ann. Math. Stat. 21(1), 124\u2013127 (1950)","journal-title":"Ann. Math. Stat."},{"key":"17_CR35","doi-asserted-by":"crossref","unstructured":"Summers, T., Shames, I., Lygeros, J., D\u00f6rfler, F.: Topology design for optimal network coherence. In: 2015 European Control Conference (ECC), pp. 575\u2013580. IEEE (2015)","DOI":"10.1109\/ECC.2015.7330605"},{"key":"17_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1140\/epjb\/e2014-50276-0","volume":"87","author":"X Wang","year":"2014","unstructured":"Wang, X., Pournaras, E., Kooij, R.E., Mieghem, P.V.: Improving robustness of complex networks via the effective graph resistance. Eur. Phys. J. B 87, 1\u201312 (2014)","journal-title":"Eur. Phys. J. B"},{"key":"17_CR37","doi-asserted-by":"crossref","unstructured":"Yazdani, A., Jeffrey, P.: Complex network analysis of water distribution systems. Chaos 21, 016111 (2011)","DOI":"10.1063\/1.3540339"},{"key":"17_CR38","doi-asserted-by":"publisher","first-page":"3350","DOI":"10.1109\/TIFS.2023.3279979","volume":"18","author":"L Zhu","year":"2023","unstructured":"Zhu, L., Bao, Q., Zhang, Z.: Measures and optimization for robustness and vulnerability in disconnected networks. IEEE Trans. Inf. Forensics Secur. 18, 3350\u20133362 (2023)","journal-title":"IEEE Trans. Inf. Forensics Secur."}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases. Research Track"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-70365-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T04:05:37Z","timestamp":1725163537000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-70365-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031703645","9783031703652"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-70365-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"22 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vilnius","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lithuania","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2024.ecmlpkdd.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}