{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T14:31:12Z","timestamp":1725719472506},"publisher-location":"Vienna","reference-count":20,"publisher":"Springer Vienna","isbn-type":[{"type":"print","value":"9783709113455"},{"type":"electronic","value":"9783709113462"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-7091-1346-2_11","type":"book-chapter","created":{"date-parts":[[2013,3,14]],"date-time":"2013-03-14T07:42:05Z","timestamp":1363246925000},"page":"255-273","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Extraction of High-Betweenness Vertices from Heterogeneous Networks"],"prefix":"10.1007","author":[{"given":"Wen Haw","family":"Chong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei Shan Belinda","family":"Toh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Loo Nin","family":"Teow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,12,21]]},"reference":[{"key":"11_CR1","unstructured":"Anthonisse, J.: The rush in a directed graph. Technical Reports BN 9\/71, Stichting Mathematisch Centrum (1971)"},{"issue":"5439","key":"11_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barabasi","year":"1999","unstructured":"Barabasi, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"issue":"3","key":"11_CR3","doi-asserted-by":"publisher","first-page":"036113","DOI":"10.1103\/PhysRevE.71.036113","volume":"71","author":"V Batagelj","year":"2005","unstructured":"Batagelj, V., Brandes, U.: Efficient generation of large random networks. Phys. Rev. E 71(3), 036113 (2005)","journal-title":"Phys. Rev. E"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1002\/rsa.1009","volume":"18","author":"B Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B., Riordan, O., Spencer, J., Tusn\u00e1dy, G.: The degree sequence of a scale-free random graph process. RSA Random Struct. Algorithms 18, 279\u2013290 (2001)","journal-title":"RSA Random Struct. Algorithms"},{"issue":"25","key":"11_CR5","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1080\/0022250X.2001.9990249","volume":"2","author":"U Brandes","year":"2001","unstructured":"Brandes, U.: A faster algorithm for betweenness centrality. J. Math. Sociol. 2(25), 163\u2013177 (2001)","journal-title":"J. Math. Sociol."},{"issue":"17","key":"11_CR6","doi-asserted-by":"crossref","first-page":"2303","DOI":"10.1142\/S0218127407018403","volume":"7","author":"U Brandes","year":"2007","unstructured":"Brandes, U., Pich, C.: Centrality estimation in large networks. Int. J. Bifurc. Chaos 7(17), 2303\u20132318 (2007)","journal-title":"Int. J. Bifurc. Chaos"},{"key":"11_CR7","unstructured":"CAIDA: The CAIDA AS relationship dataset. \n                  http:\/\/www.caida.org\/data\/active\/as-relationships\n                  \n                 (2007)"},{"issue":"2","key":"11_CR8","first-page":"157","volume":"28","author":"SR Corman","year":"2002","unstructured":"Corman, S.R., Kuhn, T., Mcphee, R.D., Dooley, K.J.: Studying complex discursive systems. Hum. Commun. Res. 28(2), 157\u2013206 (2002)","journal-title":"Hum. Commun. Res."},{"issue":"1","key":"11_CR9","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":"11_CR10","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1214\/aoms\/1177706098","volume":"30","author":"EN Gilbert","year":"1959","unstructured":"Gilbert, E.N.: Random graphs. Ann. Math. Stat. 30, 1141\u20131144 (1959)","journal-title":"Random graphs. Ann. Math. Stat."},{"issue":"58","key":"11_CR11","first-page":"713","volume":"301","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 301(58), 713\u2013721 (1963)","journal-title":"J. Am. Stat. Assoc."},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1038\/35075138","volume":"411","author":"H Jeong","year":"2001","unstructured":"Jeong, H., Mason, S.P., Barabasi, A.L., Oltvai, Z.N.: Lethality and centrality in protein networks. Nature 411, 41\u201342 (2001)","journal-title":"Nature"},{"key":"11_CR13","unstructured":"Ley, M.: The DBLP computer science bibliography. \n                  http:\/\/www.informatik.uni-trier.de\/~ley\/db"},{"key":"11_CR14","first-page":"91","volume-title":"Advances in Knowledge Discovery and Data Mining, 14th Pacific-Asia Conference, PAKDD 2010, Hyderabad. Proceedings. Part I, Lecture Notes in Computer Science","author":"AS Maiya","year":"2010","unstructured":"Maiya, A.S., Berger-Wolf, T.Y.: Online sampling of high centrality individuals in social networks. In: Zaki, M.J., Yu, J.X., Ravindran, B. Pudi, V. (eds.) Advances in Knowledge Discovery and Data Mining, 14th Pacific-Asia Conference, PAKDD 2010, Hyderabad. Proceedings. Part I, Lecture Notes in Computer Science, vol. 6118, pp. 91\u201398. Springer, Berlin (2010)"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/S0375-9601(99)00757-4","volume":"263","author":"M.E.J. Newman","year":"1999","unstructured":"Newman, M.E.J., Watts, D.J.: Renormalization group analysis of the small-world network model. Phys. Lett. A 263, 341\u2013346 (1999)","journal-title":"Phys. Lett. A"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Okamoto, K., Chen, W., yang Li, X.: Ranking of closeness centrality for large-scale social networks. In: Proceedings of the 2nd Annual International Workshop on Frontiers in Algorithmics, 2008, pp. 186\u2013195. Springer-Verlag Berlin, Heidelberg (2008)","DOI":"10.1007\/978-3-540-69311-6_21"},{"key":"11_CR17","unstructured":"Shetty, J., Adibi, J.: Enron Dataset. \n                  http:\/\/www.isi.edu\/~adibi\/Enron\/Enron.htm\n                  \n                 (2004)"},{"key":"11_CR18","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970265","volume-title":"Data Structures and Network Algorithms","author":"RE Tarjan","year":"1983","unstructured":"Tarjan, R.E.: Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia (1983)"},{"key":"11_CR19","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019 networks. Nature 393, 440\u2013442 (1998)","journal-title":"Nature"},{"key":"11_CR20","unstructured":"Wu, J., Tan, Y.J., Deng, H.Z., Zhu, D.Z.: A new measure of heterogeneity of complex networks based on degree sequence. In: International Conference on Complex Systems. Springer, Berlin\/New York (2006)"}],"container-title":["Lecture Notes in Social Networks","The Influence of Technology on Social Network Analysis and Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-7091-1346-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T15:22:23Z","timestamp":1557588143000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-7091-1346-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,21]]},"ISBN":["9783709113455","9783709113462"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-7091-1346-2_11","relation":{},"ISSN":["2190-5428","2190-5436"],"issn-type":[{"type":"print","value":"2190-5428"},{"type":"electronic","value":"2190-5436"}],"subject":[],"published":{"date-parts":[[2012,12,21]]}}}