{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:43:55Z","timestamp":1743047035354,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319161112"},{"type":"electronic","value":"9783319161129"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-16112-9_11","type":"book-chapter","created":{"date-parts":[[2015,3,14]],"date-time":"2015-03-14T13:06:02Z","timestamp":1426338362000},"page":"111-121","source":"Crossref","is-referenced-by-count":6,"title":["An Efficient Estimation of a Node\u2019s Betweenness"],"prefix":"10.1007","author":[{"given":"Manas","family":"Agarwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rishi Ranjan","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shubham","family":"Chaudhary","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. R. S.","family":"Iyengar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Anthonisse, J.M.: The rush in a directed graph. Stichting Mathematisch Centrum. Mathematische Besliskunde (BN 9\/71), 1\u201310 (1971)","key":"11_CR1"},{"key":"11_CR2","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":"D.A. 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.\u00a04863, pp. 124\u2013137. Springer, Heidelberg (2007)"},{"issue":"5439","key":"11_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A.-L. Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.-L., Albert, R.: Emergence of scaling in random networks. Science\u00a0286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"unstructured":"Batagelj, V., Mrvar, A.: Pajek datasets (2006), \n                    http:\/\/vlado.fmf.uni-lj.si\/pub\/networks\/data","key":"11_CR4"},{"issue":"2","key":"11_CR5","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. The Journal of Mathematical Sociology\u00a025(2), 163\u2013177 (2001)","journal-title":"The Journal of Mathematical Sociology"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"Network Analysis","year":"2005","unstructured":"Brandes, U., Erlebach, T. (eds.): Network Analysis. LNCS, vol.\u00a03418. Springer, Heidelberg (2005)"},{"issue":"07","key":"11_CR7","doi-asserted-by":"publisher","first-page":"2303","DOI":"10.1142\/S0218127407018403","volume":"17","author":"U. Brandes","year":"2007","unstructured":"Brandes, U., Pich, C.: Centrality estimation in large networks. International Journal of Bifurcation and Chaos\u00a017(07), 2303\u20132318 (2007)","journal-title":"International Journal of Bifurcation and Chaos"},{"issue":"9","key":"11_CR8","doi-asserted-by":"publisher","first-page":"2443","DOI":"10.1093\/nar\/gkg340","volume":"31","author":"D. Bu","year":"2003","unstructured":"Bu, D., Zhao, Y., Cai, L., Xue, H., Zhu, X., Lu, H., Zhang, J., Sun, S., Ling, L., Zhang, N., et al.: Topological structure analysis of the protein\u2013protein interaction network in budding yeast. Nucleic Acids Research\u00a031(9), 2443\u20132450 (2003)","journal-title":"Nucleic Acids Research"},{"doi-asserted-by":"crossref","unstructured":"Chehreghani, M.H.: An efficient algorithm for approximate betweenness centrality computation. The Computer Journal, page bxu003 (2014)","key":"11_CR9","DOI":"10.1093\/comjnl\/bxu003"},{"issue":"1","key":"11_CR10","first-page":"1","volume":"38","author":"T.A. Davis","year":"2011","unstructured":"Davis, T.A., Hu, Y.: The university of florida sparse matrix collection. ACM Transactions on Mathematical Software (TOMS)\u00a038(1), 1 (2011)","journal-title":"ACM Transactions on Mathematical Software (TOMS)"},{"key":"11_CR11","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P. Erdos","year":"1959","unstructured":"Erdos, P., Renyi, A.: On random graphs i. Publ. Math. Debrecen\u00a06, 290\u2013297 (1959)","journal-title":"Publ. Math. Debrecen"},{"issue":"1","key":"11_CR12","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"L.C. Freeman","year":"1977","unstructured":"Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry\u00a040(1), 35\u201341 (1977)","journal-title":"Sociometry"},{"doi-asserted-by":"crossref","unstructured":"Geisberger, R., Sanders, P., Schultes, D.: Better Approximation of Betweenness Centrality, ch.\u00a08, pp. 90\u2013100 (2008)","key":"11_CR13","DOI":"10.1137\/1.9781611972887.9"},{"unstructured":"Gkorou, D., Pouwelse, J., Epema, D., Kielmann, T., van Kreveld, M., Niessen, W.: Efficient approximate computation of betweenness centrality. In: 16th Annual Conf. of the Advanced School for Computing and Imaging, ASCI 2010 (2010)","key":"11_CR14"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-319-03536-9_14","volume-title":"Algorithms and Models for the Web Graph","author":"K. Goel","year":"2013","unstructured":"Goel, K., Singh, R.R., Iyengar, S., Sukrit: A faster algorithm to update betweenness centrality after node alteration. In: Bonato, A., Mitzenmacher, M., Pra\u0142at, P. (eds.) WAW 2013. LNCS, vol.\u00a08305, pp. 170\u2013184. Springer, Heidelberg (2013)"},{"doi-asserted-by":"crossref","unstructured":"Green, O., McColl, R., Bader, D.A.: A fast algorithm for streaming betweenness centrality. In: 2012 International Conference on Privacy, Security, Risk and Trust (PASSAT) and 2012 International Confernece on Social Computing (SocialCom), pp. 11\u201320 (September 2012)","key":"11_CR16","DOI":"10.1109\/SocialCom-PASSAT.2012.37"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/2492517.2492533","volume-title":"Proceedings of the 2013 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2013","author":"M. Kas","year":"2013","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. ACM, New York (2013)"},{"unstructured":"Kintali, S.: Betweenness centrality: Algorithms and lower bounds. arXiv preprint arXiv:0809.1906 (2008)","key":"11_CR18"},{"key":"11_CR19","volume-title":"The Stanford GraphBase: a platform for combinatorial computing","author":"D.E. Knuth","year":"1993","unstructured":"Knuth, D.E.: The Stanford GraphBase: a platform for combinatorial computing, vol.\u00a037. Addison-Wesley, Reading (1993)"},{"key":"11_CR20","first-page":"351","volume-title":"Proceedings of the 21st International Conference on World Wide Web, WWW 2012","author":"M.-J. Lee","year":"2012","unstructured":"Lee, M.-J., Lee, J., Park, J.Y., Choi, R.H., Chung, C.-W.: Qube: A quick algorithm for updating betweenness centrality. In: Proceedings of the 21st International Conference on World Wide Web, WWW 2012, pp. 351\u2013360. ACM, New York (2012)"},{"unstructured":"Leskovec, J.: Stanford large network dataset collection (2010)","key":"11_CR21"},{"doi-asserted-by":"crossref","unstructured":"Nasre, M., Pontecorvi, M., Ramachandran, V.: Betweenness centality\u2013incremental and faster. arXiv preprint arXiv:1311.2147 (2013)","key":"11_CR22","DOI":"10.1007\/978-3-662-44465-8_49"},{"key":"11_CR23","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: An Introduction","author":"M. Newman","year":"2010","unstructured":"Newman, M.: Networks: An Introduction. Oxford University Press, Inc., New York (2010)"},{"doi-asserted-by":"crossref","unstructured":"Riondato, M., Kornaropoulos, E.M.: Fast approximation of betweenness centrality through sampling. In: Proceedings of the 7th ACM International Conference on Web Search and Data Mining, pp. 413\u2013422. ACM (2014)","key":"11_CR24","DOI":"10.1145\/2556195.2556224"},{"doi-asserted-by":"crossref","unstructured":"Sariy\u00fcce, A.E., Saule, E., Kaya, K., \u00c7ataly\u00fcrek, \u00dc.V.: Shattering and compressing networks for betweenness centrality. In: SIAM Data Mining Conference (SDM). SIAM (2013)","key":"11_CR25","DOI":"10.1137\/1.9781611972832.76"},{"doi-asserted-by":"crossref","unstructured":"Taylor, P.J.: World city network: a global urban analysis. Psychology Press (2004)","key":"11_CR26","DOI":"10.4324\/9780203634059"},{"unstructured":"Ulanowicz, R.E., DeAngelis, D.L.: Network analysis of trophic dynamics in south florida ecosystems. In: FY97: The Florida Bay Ecosystem, pp. 20688\u201320038 (1998)","key":"11_CR27"},{"unstructured":"Van Der Hofstad, R.: Random graphs and complex networks (2009), \n                    http:\/\/www.win.tue.nl\/rhofstad\/NotesRGCN.pdf","key":"11_CR28"},{"doi-asserted-by":"crossref","unstructured":"Wang, X.: Deciding on the type of the degree distribution of a graph (network) from traceroute-like measurements (2011)","key":"11_CR29","DOI":"10.5121\/ijcnc.2012.4311"},{"issue":"6684","key":"11_CR30","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"D.J. Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of small-world networks. Nature\u00a0393(6684), 440\u2013442 (1998)","journal-title":"Nature"}],"container-title":["Studies in Computational Intelligence","Complex Networks VI"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-16112-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T07:12:06Z","timestamp":1676445126000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-16112-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319161112","9783319161129"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-16112-9_11","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2015]]}}}