{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T10:36:41Z","timestamp":1763203001391,"version":"3.45.0"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032104588"},{"type":"electronic","value":"9783032104595"}],"license":[{"start":{"date-parts":[[2025,11,16]],"date-time":"2025-11-16T00:00:00Z","timestamp":1763251200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,16]],"date-time":"2025-11-16T00:00:00Z","timestamp":1763251200000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-10459-5_10","type":"book-chapter","created":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T07:06:46Z","timestamp":1763190406000},"page":"116-128","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Incremental Distributed Algorithms for\u00a0Game-Theoretic Betweenness Centralities in\u00a0Dynamic Graphs"],"prefix":"10.1007","author":[{"given":"Yefei","family":"Wang","sequence":"first","affiliation":[]},{"given":"Qiang-Sheng","family":"Hua","sequence":"additional","affiliation":[]},{"given":"Wenjie","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Hai","family":"Jin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,11,16]]},"reference":[{"issue":"3","key":"10_CR1","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/0378-8733(82)90022-3","volume":"4","author":"BN Grofman","year":"1982","unstructured":"Grofman, B.N., Owen, G.: A game theoretic approach to measuring degree of centrality in social networks. Soc. Netw. 4(3), 213\u2013224 (1982)","journal-title":"Soc. Netw."},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.artint.2015.11.001","volume":"231","author":"PL Szczepanski","year":"2016","unstructured":"Szczepanski, P.L., Michalak, T.P., Rahwan, T.: Efficient algorithms for game-theoretic betweenness centrality. Artif. Intell. 231, 39\u201363 (2016)","journal-title":"Artif. Intell."},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Wang, Y., Hua, Q., Gao, W., Jin, H.: Nearly optimal distributed algorithm for computing game-theoretic betweenness centralities. Chin. J. Comput. (2025, to appear)","DOI":"10.1007\/978-3-032-10459-5_10"},{"key":"10_CR4","unstructured":"Szczepanski, P.L., Michalak, T.P., Rahwan, T.: A new approach to betweenness centrality based on the Shapley value. In: Proceedings of AAMAS 2012, pp. 239\u2013246 (2012)"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1613\/jair.1.11239","volume":"63","author":"MK Tarkowski","year":"2018","unstructured":"Tarkowski, M.K., Szczepanski, P.L., Michalak, T.P., Harrenstein, P., Wooldridge, M.J.: Efficient computation of semi-values for game-theoretic network centrality. J. Artif. Intell. Res. 63, 145\u2013189 (2018)","journal-title":"J. Artif. Intell. Res."},{"issue":"3","key":"10_CR6","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1109\/TPDS.2017.2763951","volume":"29","author":"FT Jamour","year":"2018","unstructured":"Jamour, F.T., Skiadopoulos, S., Kalnis, P.: Parallel algorithm for incremental betweenness centrality on large graphs. IEEE Trans. Parallel Distrib. Syst. 29(3), 659\u2013672 (2018)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Pons, R.G.: Space efficient incremental betweenness algorithm for directed graphs. In: Proceedings of CIARP 2018, pp. 262\u2013270 (2018)","DOI":"10.1007\/978-3-030-13469-3_31"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Shukla, K., Regunta, S.C., Tondomker, S.H., Kothapalli, K.: Efficient parallel algorithms for betweenness- and closeness-centrality in dynamic graphs. In: Proceedings of ICS 2020, pp. 10:1\u201310:12 (2020)","DOI":"10.1145\/3392717.3392743"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Haryan, C.A., Ramakrishna, G., Kothapalli, K., Banerjee, D.S.: Shared-memory parallel algorithms for fully dynamic maintenance of 2-connected components. In: Proceedings of IPDPS 2022, pp. 1195\u20131205 (2022)","DOI":"10.1109\/IPDPS53621.2022.00119"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Lenzen, C., Peleg, D.: Efficient distributed source detection with limited bandwidth. In: Proceedings of PODC 2013, pp. 375\u2013382 (2013)","DOI":"10.1145\/2484239.2484262"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Harary, F.: Graph Theory. Addison-Wesley Publishing Company (1969)","DOI":"10.21236\/AD0705364"},{"key":"10_CR12","unstructured":"Zhu, X., Chen, W., Zheng, W., Ma, X.: Gemini: a computation-centric distributed graph processing system. In: Proceedings of OSDI 2016, pp. 301\u2013316 (2016)"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Davis, T.A., Hu, Y.: The university of Florida sparse matrix collection. ACM Trans. Math. Softw. 38(1), 1:1\u20131:25 (2011)","DOI":"10.1145\/2049662.2049663"}],"container-title":["Lecture Notes in Computer Science","Network and Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-10459-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T08:03:45Z","timestamp":1763193825000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-10459-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,16]]},"ISBN":["9783032104588","9783032104595"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-10459-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,11,16]]},"assertion":[{"value":"16 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NPC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP International Conference on Network and Parallel Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nha Trang","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietnam","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"npc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.npc-conference.com\/#\/npc2025","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}