{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T20:24:16Z","timestamp":1784751856556,"version":"3.55.0"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030868376","type":"print"},{"value":"9783030868383","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86838-3_17","type":"book-chapter","created":{"date-parts":[[2021,9,19]],"date-time":"2021-09-19T22:05:30Z","timestamp":1632089130000},"page":"219-231","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality"],"prefix":"10.1007","author":[{"given":"Maciej","family":"Rymar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hendrik","family":"Molter","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andr\u00e9","family":"Nichterlein","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,9,20]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Afrasiabi Rad, A., Flocchini, P., Gaudet, J.: Computation and analysis of temporal betweenness in a knowledge mobilization network. Comput. Soc. Netw. 4(1), 5 (2017)","DOI":"10.1186\/s40649-017-0041-7"},{"key":"17_CR2","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Data Structures and Algorithms. Addison-Wesley (1983)"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.chaos.2014.12.009","volume":"72","author":"A Alsayed","year":"2015","unstructured":"Alsayed, A., Higham, D.J.: Betweenness in time dependent networks. Chaos Solitons Fractals 72, 35\u201348 (2015)","journal-title":"Chaos Solitons Fractals"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-540-77004-6_10","volume-title":"Algorithms and Models for the Web-Graph","author":"DA Bader","year":"2007","unstructured":"Bader, D.A., Kintali, S., Madduri, K., Mihail, M.: Approximating betweenness centrality. In: Bonato, A., Chung, F.R.K. (eds.) WAW 2007. LNCS, vol. 4863, pp. 124\u2013137. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77004-6_10"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Baglioni, M., Geraci, F., Pellegrini, M., Lastres, E.: Fast exact computation of betweenness centrality in social networks. In: Proceedings of the 4th International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012), pp. 450\u2013456. IEEE Computer Society (2012)","DOI":"10.1109\/ASONAM.2012.79"},{"issue":"1","key":"17_CR6","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"R Bellman","year":"1958","unstructured":"Bellman, R.: On a routing problem. Q. Appl. Math. 16(1), 87\u201390 (1958)","journal-title":"Q. Appl. Math."},{"issue":"3","key":"17_CR7","doi-asserted-by":"publisher","first-page":"483","DOI":"10.7155\/jgaa.00543","volume":"24","author":"M Bentert","year":"2020","unstructured":"Bentert, M., Dittmann, A., Kellerhals, L., Nichterlein, A., Niedermeier, R.: An adaptive version of Brandes\u2019 algorithm for betweenness centrality. J. Graph Algorithms Appl. 24(3), 483\u2013522 (2020)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"17_CR8","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s41109-020-00311-0","volume":"5","author":"M Bentert","year":"2020","unstructured":"Bentert, M., Himmel, A.-S., Nichterlein, A., Niedermeier, R.: Efficient computation of optimal temporal walks under waiting-time constraints. Appl. Netw. Sci. 5(1), 73 (2020)","journal-title":"Appl. Netw. Sci."},{"issue":"2","key":"17_CR9","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1080\/0022250X.2001.9990249","volume":"25","author":"U Brandes","year":"2001","unstructured":"Brandes, U.: A faster algorithm for betweenness centrality. J. Math. Sociol. 25(2), 163\u2013177 (2001)","journal-title":"J. Math. Sociol."},{"issue":"02","key":"17_CR10","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1142\/S0129054103001728","volume":"14","author":"B-M Bui-Xuan","year":"2003","unstructured":"Bui-Xuan, B.-M., Ferreira, A., Jarry, A.: Computing shortest, fastest, and foremost journeys in dynamic networks. Int. J. Found. Comput. Sci. 14(02), 267\u2013285 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Bu\u00df, S., Molter, H., Niedermeier, R., Rymar, M.: Algorithmic aspects of temporal betweenness. In: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (KDD 2020), pp. 2084\u20132092. Association for Computing Machinery (2020)","DOI":"10.1145\/3394486.3403259"},{"key":"17_CR12","unstructured":"Casteigts, A., Himmel, A.-S., Molter, H., Zschoche, P.: The computational complexity of finding temporal paths under waiting time constraints. In: Proceedings of the 31st International Symposium on Algorithms and Computation (ISAAC 2020), LIPIcs, vol. 181, pages 30:1\u201330:18. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"17_CR13","unstructured":"Ford Jr., L.R.: Network flow theory. Technical report, Rand Corp Santa Monica CA (1956)"},{"issue":"1","key":"17_CR14","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"LC Freeman","year":"1977","unstructured":"Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry 40(1), 35\u201341 (1977)","journal-title":"Sociometry"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Geisberger, R., Sanders, P., Schultes, D.: Better approximation of betweenness centrality. In: Proceedings of the 10th Meeting on Algorithm Engineering & Expermiments (ALENEX 2008), pp. 90\u2013100. SIAM (2008)","DOI":"10.1137\/1.9781611972887.9"},{"issue":"8","key":"17_CR16","doi-asserted-by":"publisher","first-page":"1133","DOI":"10.1007\/s10994-016-5583-7","volume":"106","author":"VM Gunturi","year":"2017","unstructured":"Gunturi, V.M., Shekhar, S., Joseph, K., Carley, K.M.: Scalable computational techniques for centrality metrics on temporally detailed social network. Mach. Learn. 106(8), 1133\u20131169 (2017)","journal-title":"Mach. Learn."},{"key":"17_CR17","unstructured":"Habiba, H., Tantipathananandh, C., Berger-Wolf, T.Y.: Betweenness centrality measure in dynamic networks. Technical Report 19, Department of Computer Science, University of Illinois at Chicago, Chicago, DIMACS Technical Report (2007)"},{"issue":"4","key":"17_CR18","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1006\/jcss.2002.1829","volume":"64","author":"D Kempe","year":"2002","unstructured":"Kempe, D., Kleinberg, J., Kumar, A.: Connectivity and inference problems for temporal networks. J. Comput. Syst. Sci. 64(4), 820\u2013842 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Kim, H., Anderson, R.: Temporal node centrality in complex networks. Phys. Rev. E 85(2), 026107 (2012)","DOI":"10.1103\/PhysRevE.85.026107"},{"issue":"1","key":"17_CR20","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1093\/comnet\/cnu015","volume":"3","author":"R Puzis","year":"2015","unstructured":"Puzis, R., Elovici, Y., Zilberman, P., Dolev, S., Brandes, U.: Topology manipulations for speeding betweenness centrality computation. J. Complex Netw. 3(1), 84\u2013112 (2015)","journal-title":"J. Complex Netw."},{"issue":"2","key":"17_CR21","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/s10618-015-0423-0","volume":"30","author":"M Riondato","year":"2016","unstructured":"Riondato, M., Kornaropoulos, E.M.: Fast approximation of betweenness centrality through sampling. Data Min. Knowl. Discov. 30(2), 438\u2013475 (2016)","journal-title":"Data Min. Knowl. Discov."},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Rymar, M., Molter, H., Nichterlein, A., Niedermeier, R.: Towards classifying the polynomial-time solvability of temporal betweenness centrality. CoRR, abs\/2105.13055 (2021). https:\/\/arxiv.org\/abs\/2105.13055","DOI":"10.1007\/978-3-030-86838-3_17"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Sariy\u00fcce, A.E., Kaya, K., Saule, E., \u00c7ataly\u00fcrek, \u00dc.V.: Graph manipulations for fast centrality computation. ACM Trans. Knowl. Discovery Data 11(3):26:1\u201326:25 (2017)","DOI":"10.1145\/3022668"},{"key":"17_CR24","unstructured":"Simard, F., Magnien, C., Latapy, M.: Computing betweenness centrality in link streams. CoRR, abs\/2102.06543 (2021). https:\/\/arxiv.org\/abs\/2102.06543"},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"Tang, J., Musolesi, M., Mascolo, C., Latora, V., Nicosia, V.: Analysing information flows and key mediators through temporal centrality metrics. In: Proceedings of the 3rd Workshop on Social Network Systems (SNS 2010). Association for Computing Machinery (2010)","DOI":"10.1145\/1852658.1852661"},{"issue":"3","key":"17_CR26","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s41060-019-00189-x","volume":"9","author":"I Tsalouchidou","year":"2020","unstructured":"Tsalouchidou, I., Baeza-Yates, R., Bonchi, F., Liao, K., Sellis, T.: Temporal betweenness centrality in dynamic graphs. Int. J. Data Sci. Anal. 9(3), 257\u2013272 (2020)","journal-title":"Int. J. Data Sci. Anal."},{"key":"17_CR27","doi-asserted-by":"crossref","unstructured":"Williams, M.J., Musolesi, M.: Spatio-temporal networks: reachability, centrality and robustness. Roy. Soc. Open Sci. 3(6) (2016)","DOI":"10.1098\/rsos.160196"},{"issue":"11","key":"17_CR28","doi-asserted-by":"publisher","first-page":"2927","DOI":"10.1109\/TKDE.2016.2594065","volume":"28","author":"H Wu","year":"2016","unstructured":"Wu, H., Cheng, J., Ke, Y., Huang, S., Huang, Y., Wu, H.: Efficient algorithms for temporal path computation. IEEE Trans. Knowl. Data Eng. 28(11), 2927\u20132942 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"17_CR29","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.jcss.2019.07.006","volume":"107","author":"P Zschoche","year":"2020","unstructured":"Zschoche, P., Fluschnik, T., Molter, H., Niedermeier, R.: The complexity of finding separators in temporal graphs. J. Comput. Syst. Sci. 107, 72\u201392 (2020)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86838-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T20:02:55Z","timestamp":1702065775000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86838-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030868376","9783030868383"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86838-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"47","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair and OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held online due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}