{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T05:10:06Z","timestamp":1751692206227,"version":"3.41.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319930398"},{"type":"electronic","value":"9783319930404"}],"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-93040-4_59","type":"book-chapter","created":{"date-parts":[[2018,6,16]],"date-time":"2018-06-16T13:29:41Z","timestamp":1529155781000},"page":"752-764","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Efficient Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs"],"prefix":"10.1007","author":[{"given":"Mostafa Haghir","family":"Chehreghani","sequence":"first","affiliation":[]},{"given":"Albert","family":"Bifet","sequence":"additional","affiliation":[]},{"given":"Talel","family":"Abdessalem","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,17]]},"reference":[{"key":"59_CR1","unstructured":"Agarwal, M., Singh, R.R., Chaudhary, S., Iyengar, S.: Betweenness ordering problem: an efficient non-uniform sampling technique for large graphs. CoRR abs\/1409.6470 (2014)"},{"key":"59_CR2","doi-asserted-by":"crossref","unstructured":"Borassi, M., Natale, E.: KADABRA is an adaptive algorithm for betweenness via random approximation. In: 24th European Symposium on Algorithms, pp. 1\u201318 (2016)","DOI":"10.1145\/3284359"},{"issue":"2","key":"59_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. Sociol. 25(2), 163\u2013177 (2001)","journal-title":"J. Math. Sociol."},{"issue":"7","key":"59_CR4","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1142\/S0218127407018403","volume":"17","author":"U Brandes","year":"2007","unstructured":"Brandes, U., Pich, C.: Centrality estimation in large networks. Int. J. Bifurcat. Chaos 17(7), 303\u2013318 (2007)","journal-title":"Int. J. Bifurcat. Chaos"},{"key":"59_CR5","doi-asserted-by":"crossref","unstructured":"\u00c7ataly\u00fcrek, \u00dc.V., Kaya, K., Sariy\u00fcce, A.E., Saule, E.: Shattering and compressing networks for betweenness centrality. In: SDM, pp. 686\u2013694 (2013)","DOI":"10.1137\/1.9781611972832.76"},{"key":"59_CR6","doi-asserted-by":"crossref","unstructured":"Chehreghani, M.H.: Effective co-betweenness centrality computation. In: Seventh ACM International Conference on Web Search and Data Mining, pp. 423\u2013432 (2014)","DOI":"10.1145\/2556195.2556263"},{"issue":"9","key":"59_CR7","doi-asserted-by":"publisher","first-page":"1371","DOI":"10.1093\/comjnl\/bxu003","volume":"57","author":"MH Chehreghani","year":"2014","unstructured":"Chehreghani, M.H.: An efficient algorithm for approximate betweenness centrality computation. Comput. J. 57(9), 1371\u20131382 (2014)","journal-title":"Comput. J."},{"key":"59_CR8","unstructured":"Chehreghani, M.H., Bifet, A., Abdessalem, T.: Discriminative distance-based network indices with application to link prediction. Comput. J. (2018, to appear)"},{"issue":"3","key":"59_CR9","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1080\/0022250X.1999.9990219","volume":"23","author":"M Everett","year":"1999","unstructured":"Everett, M., Borgatti, S.: The centrality of groups and classes. J. Math. Sociol. 23(3), 181\u2013201 (1999)","journal-title":"J. Math. Sociol."},{"key":"59_CR10","first-page":"35","volume":"40","author":"LC Freeman","year":"1977","unstructured":"Freeman, L.C.: A set of measures of centrality based upon betweenness, sociometry. Soc. Netw. 40, 35\u201341 (1977)","journal-title":"Soc. Netw."},{"issue":"2","key":"59_CR11","doi-asserted-by":"publisher","first-page":"48","DOI":"10.14778\/2850578.2850580","volume":"9","author":"T Hayashi","year":"2015","unstructured":"Hayashi, T., Akiba, T., Yoshida, Y.: Fully dynamic betweenness centrality maintenance on massive networks. Proc. VLDB Endowment 9(2), 48\u201359 (2015)","journal-title":"Proc. VLDB Endowment"},{"issue":"301","key":"59_CR12","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58(301), 13\u201330 (1963)","journal-title":"J. Am. Stat. Assoc."},{"key":"59_CR13","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1137\/1.9781611972818.11","volume-title":"Proceedings of the 2011 SIAM International Conference on Data Mining","author":"U Kang","year":"2011","unstructured":"Kang, U., Papadimitriou, S., Sun, J., Tong, H.: Centralities in large networks: algorithms and observations. In: SDM, pp. 119\u2013130 (2011)"},{"issue":"1","key":"59_CR14","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/1232722.1232727","volume":"1","author":"Jure Leskovec","year":"2007","unstructured":"Leskovec, J., Adamic, L.A., Huberman, B.A.: The dynamics of viral marketing. ACM Trans. Web (TWEB) 1(1) (2007)","journal-title":"ACM Transactions on the Web"},{"key":"59_CR15","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Huttenlocher, D.P., Kleinberg, J.M.: Signed networks in social media. In: CHI, pp. 1361\u20131370 (2010)","DOI":"10.1145\/1753326.1753532"},{"issue":"1","key":"59_CR16","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1217299.1217301","volume":"1","author":"Jure Leskovec","year":"2007","unstructured":"Leskovec, J., Kleinberg, J.M., Faloutsos, C.: Graph evolution: densification and shrinking diameters. ACM Trans. Knowl. Discov. Data 1(1) (2007)","journal-title":"ACM Transactions on Knowledge Discovery from Data"},{"key":"59_CR17","doi-asserted-by":"crossref","unstructured":"Mahmoody, A., Tsourakakis, C.E., Upfal, E.: Scalable betweenness centrality maximization via sampling. In: KDD, pp. 1765\u20131773 (2016)","DOI":"10.1145\/2939672.2939869"},{"key":"59_CR18","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"MEJ Newman","year":"2003","unstructured":"Newman, M.E.J.: The structure and function of complex networks. SIAM Rev. 45, 167\u2013256 (2003)","journal-title":"SIAM Rev."},{"issue":"2","key":"59_CR19","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 Mining Knowl. Discov. 30(2), 438\u2013475 (2016)","journal-title":"Data Mining Knowl. Discov."},{"key":"59_CR20","doi-asserted-by":"crossref","unstructured":"Riondato, M., Upfal, E.: ABRA: approximating betweenness centrality in static and dynamic graphs with Rademacher averages. In: KDD, pp. 1145\u20131154 (2016)","DOI":"10.1145\/2939672.2939770"},{"key":"59_CR21","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.ijcip.2015.05.003","volume":"10","author":"G Stergiopoulos","year":"2015","unstructured":"Stergiopoulos, G., Kotzanikolaou, P., Theocharidou, M., Gritzalis, D.: Risk mitigation strategies for critical infrastructures based on graph centrality analysis. Int. J. Crit. Infrastruct. Protect. 10, 34\u201344 (2015)","journal-title":"Int. J. Crit. Infrastruct. Protect."},{"key":"59_CR22","doi-asserted-by":"crossref","unstructured":"Yang, J., Leskovec, J.: Defining and evaluating network communities based on ground-truth. In: IEEE ICDM, pp. 745\u2013754 (2012)","DOI":"10.1145\/2350190.2350193"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-93040-4_59","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T04:38:59Z","timestamp":1751690339000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-93040-4_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319930398","9783319930404"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-93040-4_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"17 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"3 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/prada-research.net\/pakdd18\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}