{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T19:13:39Z","timestamp":1776712419680,"version":"3.51.2"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030134686","type":"print"},{"value":"9783030134693","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-13469-3_31","type":"book-chapter","created":{"date-parts":[[2019,3,2]],"date-time":"2019-03-02T13:03:53Z","timestamp":1551531833000},"page":"262-270","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Space Efficient Incremental Betweenness Algorithm for Directed Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1804-3319","authenticated-orcid":false,"given":"Reynaldo","family":"Gil-Pons","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,3]]},"reference":[{"key":"31_CR1","unstructured":"Anthonisse, J.M.: The Rush in a Directed Graph. Stichting Mathematisch Centrum, Mathematische Besliskunde (1971)"},{"key":"31_CR2","doi-asserted-by":"publisher","unstructured":"Bergamini, E., Meyerhenke, H., Ortmann, M., Slobbe, A.: Faster betweenness centrality updates in evolving networks. In: LIPIcs-Leibniz International Proceedings in Informatics, vol.\u00a075, pp. 1\u201316 (2017). https:\/\/doi.org\/10.4230\/LIPIcs.SEA.2017.23","DOI":"10.4230\/LIPIcs.SEA.2017.23"},{"issue":"2","key":"31_CR3","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. Soc. 25(2), 163\u2013177 (2001). https:\/\/doi.org\/10.1080\/0022250X.2001.9990249","journal-title":"J. Math. Soc."},{"key":"31_CR4","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2009)"},{"issue":"1","key":"31_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269\u2013271 (1959). https:\/\/doi.org\/10.1007\/BF01386390","journal-title":"Numer. Math."},{"key":"31_CR6","doi-asserted-by":"publisher","unstructured":"Freeman, L.C.: A set of measures of centrality based on betweenness (1977). https:\/\/doi.org\/10.2307\/3033543","DOI":"10.2307\/3033543"},{"key":"31_CR7","doi-asserted-by":"publisher","unstructured":"Jamour, F., Skiadopoulos, S., Kalnis, P.: Parallel algorithm for incremental betweenness centrality on large graphs. IEEE Trans. Parallel Distrib. Syst. (2017). https:\/\/doi.org\/10.1109\/TPDS.2017.2763951","DOI":"10.1109\/TPDS.2017.2763951"},{"issue":"2","key":"31_CR8","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1155\/JBB.2005.96","volume":"2005","author":"MP Joy","year":"2005","unstructured":"Joy, M.P., Brock, A., Ingber, D.E., Huang, S.: High-betweenness proteins in the yeast protein interaction network. J. Biomed. Biotechnol. 2005(2), 96\u2013103 (2005). https:\/\/doi.org\/10.1155\/JBB.2005.96","journal-title":"J. Biomed. Biotechnol."},{"key":"31_CR9","doi-asserted-by":"publisher","unstructured":"Kas, M., Wachs, M., Carley, K.M., Carley, L.R.: Incremental algorithm for updating betweenness centrality in dynamically growing networks. In: Proceedings of the 2013 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining - ASONAM 2013, pp. 33\u201340 (2013). https:\/\/doi.org\/10.1145\/2492517.2492533","DOI":"10.1145\/2492517.2492533"},{"issue":"9","key":"31_CR10","doi-asserted-by":"publisher","first-page":"2494","DOI":"10.1109\/TKDE.2015.2419666","volume":"27","author":"N Kourtellis","year":"2015","unstructured":"Kourtellis, N., Morales, G.D.F., Bonchi, F.: Scalable online betweenness centrality in evolving graphs. IEEE Trans. Know. Data Eng. 27(9), 2494\u20132506 (2015). https:\/\/doi.org\/10.1109\/TKDE.2015.2419666","journal-title":"IEEE Trans. Know. Data Eng."},{"key":"31_CR11","unstructured":"Krebs, V.E.: Mapping networks of terrorist cells. Connections 24(3), 43\u201352 (2002)"},{"key":"31_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/978-3-662-44465-8_49","volume-title":"Mathematical Foundations of Computer Science 2014","author":"M Nasre","year":"2014","unstructured":"Nasre, M., Pontecorvi, M., Ramachandran, V.: Betweenness centrality \u2013 incremental and faster. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014. LNCS, vol. 8635, pp. 577\u2013588. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44465-8_49"},{"issue":"1","key":"31_CR13","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1080\/15472450.2012.716663","volume":"17","author":"R Puzis","year":"2013","unstructured":"Puzis, R., Altshuler, Y., Elovici, Y., Bekhor, S., Shiftan, Y., Pentland, A.S.: Augmented betweenness centrality for environmentally aware traffic monitoring in transportation networks. J. Intell. Transp. Syst. 17(1), 91\u2013105 (2013). https:\/\/doi.org\/10.1080\/15472450.2012.716663","journal-title":"J. Intell. Transp. Syst."},{"key":"31_CR14","doi-asserted-by":"publisher","unstructured":"Puzis, R., Zilberman, P., Elovici, Y., Dolev, S., Brandes, U.: Heuristics for speeding up betweenness centrality computation. In: Proceedings - 2012 ASE\/IEEE International Conference on Privacy, Security, Risk and Trust and 2012 ASE\/IEEE International Conference on Social Computing, SocialCom\/PASSAT 2012, pp. 302\u2013311 (2012). https:\/\/doi.org\/10.1109\/SocialCom-PASSAT.2012.66","DOI":"10.1109\/SocialCom-PASSAT.2012.66"},{"issue":"6","key":"31_CR15","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1109\/MNET.2010.5634437","volume":"24","author":"A Tizghadam","year":"2010","unstructured":"Tizghadam, A., Leon-Garcia, A.: Betweenness centrality and resistance distance in communication networks. IEEE Netw. 24(6), 10\u201316 (2010). https:\/\/doi.org\/10.1109\/MNET.2010.5634437","journal-title":"IEEE Netw."},{"key":"31_CR16","unstructured":"Williams, V.V.: On some fine-grained questions in algorithms and complexity. In: Proceedings of the ICM (2018)"}],"container-title":["Lecture Notes in Computer Science","Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-13469-3_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T01:06:58Z","timestamp":1677719218000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-13469-3_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030134686","9783030134693"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-13469-3_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"3 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIARP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Iberoamerican Congress on Pattern Recognition","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 November 2018","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":"ciarp2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/atvs.ii.uam.es\/ciarp2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"187","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":"112","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":"60% - 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":"2,94","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":"5","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}