{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T16:45:46Z","timestamp":1747327546008,"version":"3.40.3"},"publisher-location":"New York, NY","reference-count":36,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781461461692"},{"type":"electronic","value":"9781461461708"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","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":[[2014]]},"DOI":"10.1007\/978-1-4614-6170-8_241","type":"book-chapter","created":{"date-parts":[[2014,10,4]],"date-time":"2014-10-04T14:49:44Z","timestamp":1412434184000},"page":"1256-1269","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Path-Based and Whole-Network Measures"],"prefix":"10.1007","author":[{"given":"Matteo","family":"Magnani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moreno","family":"Marzolla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,5]]},"reference":[{"key":"241_CR1654","series-title":"Technical report BN","volume-title":"The rush in a directed graph","author":"JM Anthonisse","year":"1971","unstructured":"Anthonisse JM (1971) The rush in a directed graph. Technical report BN 9\/71, Stichting Mathematisch Centrum, Amsterdam"},{"key":"241_CR1655","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/1401890.1401898","volume-title":"roceedings of the 14th ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201908","author":"L Becchetti","year":"2008","unstructured":"Becchetti L, Boldi P, Castillo C, Gionis A (2008) Efficient semi-streaming algorithms for local triangle counting in massive graphs. In: Proceedings of the 14th ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201908. ACM, New York, pp 16\u201324. doi: 10.1145\/1401890.1401898"},{"issue":"2","key":"241_CR1656","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1080\/0022250X.2001.9990249","volume":"25","author":"U Brandes","year":"2001","unstructured":"Brandes U (2001) A faster algorithm for betweenness centrality. J Math Sociol 25(2):163\u2013177. doi: 10.1080\/0022250X.2001.9990249","journal-title":"J Math Sociol"},{"issue":"07","key":"241_CR1657","doi-asserted-by":"crossref","first-page":"2303","DOI":"10.1142\/S0218127407018403","volume":"17","author":"U Brandes","year":"2007","unstructured":"Brandes U, Pich C (2007) Centrality estimation in large networks. Int J Bifurc Chaos 17(07):2303\u20132318. doi:10.1142\/S0218127407018403","journal-title":"Int J Bifurc Chaos"},{"key":"241_CR1658","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms, 3rd edn. MIT, Cambridge","edition":"3"},{"issue":"1","key":"241_CR1659","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1080\/00018730601170527","volume":"56","author":"LDF Costa","year":"2007","unstructured":"Costa LDF, Rodrigues FA, Travieso G, Villas Boas PR (2007) Characterization of complex networks: a survey of measurements. Adv Phys 56(1):167\u2013242. doi: 10.1080\/00018730601170527","journal-title":"Adv Phys"},{"key":"241_CR1660","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/978-0-387-30165-5_8","volume-title":"Handbook of optimization in telecommunications","author":"P Festa","year":"2006","unstructured":"Festa P (2006) Shortest path algorithms. In: Resende MGC, Pardalos PM (eds) Handbook of optimization in telecommunications. Springer, New York, pp 185\u2013210. doi:10.1007\/978\u20130-387\u201330165-5_8"},{"issue":"6","key":"241_CR1661","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"RW Floyd","year":"1962","unstructured":"Floyd RW (1962) Algorithm 97: shortest path. Commun ACM 5(6):345. doi:10.1145\/367766.368168","journal-title":"Commun ACM"},{"issue":"3\u20135","key":"241_CR1662","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato S (2010) Community detection in graphs. Phys Rep 486(3\u20135):75\u2013174. doi:10.1016\/ j.physrep.2009.11.002","journal-title":"Phys Rep"},{"issue":"1","key":"241_CR1663","doi-asserted-by":"crossref","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"LC Freeman","year":"1977","unstructured":"Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry 40(1):35\u201341","journal-title":"Sociometry"},{"issue":"3","key":"241_CR1664","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"LC Freeman","year":"1978","unstructured":"Freeman LC (1978) Centrality in social networks conceptual clarification. Soc Netw 1(3):215\u2013239. doi:10.1016\/0378\u20138733(78)90021\u20137","journal-title":"Soc Netw"},{"unstructured":"Gephi (2012) Gephi, an open source graph visualization and manipulation software. \n                  http:\/\/www.gephi.org\/\n                  \n                , version 0.8.1-beta, released on 29 Mar 2012","key":"241_CR1665"},{"issue":"8","key":"241_CR1666","doi-asserted-by":"crossref","first-page":"e22656","DOI":"10.1371\/journal.pone.0022656","volume":"6","author":"B Goncalves","year":"2011","unstructured":"Goncalves B, Perra N, Vespignani A (2011) Modeling users\u2019 activity on twitter networks: validation of Dunbar\u2019s number. PLoS ONE 6(8):e22656. doi: 10.1371\/journal.pone.0022656","journal-title":"PLoS ONE"},{"issue":"12","key":"241_CR1667","first-page":"2030","volume":"5","author":"S Guha","year":"2012","unstructured":"Guha S, McGregor A (2012) Graph synopses, sketches, and streams: a survey. PVLDB 5(12):2030\u20132031","journal-title":"PVLDB"},{"key":"241_CR1668","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph theory","author":"F Harary","year":"1969","unstructured":"Harary F (1969) Graph theory. Addison-Wesley, Reading, MA"},{"key":"241_CR1669","volume-title":"Graph theory as a mathematical model in the social sciences","author":"F Harary","year":"1953","unstructured":"Harary F, Norman RZ (1953) Graph theory as a mathematical model in the social sciences. Institute for Social Research, University of Michigan, Ann Arbor"},{"unstructured":"IGraph (2012) The igraph library for complex network research. \n                  http:\/\/igraph.sourceforge.net\/\n                  \n                , version 0.6, released on 11 June 2012","key":"241_CR1670"},{"issue":"1","key":"241_CR1671","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/321992.321993","volume":"24","author":"DB Johnson","year":"1977","unstructured":"Johnson DB (1977) Efficient algorithms for shortest paths in sparse networks. J ACM 24(1): 1\u201313. doi: 10.1145\/321992.321993","journal-title":"J ACM"},{"key":"241_CR1672","volume-title":"Large-scale data analytics","author":"M Lambertini","year":"2014","unstructured":"Lambertini M, Magnani M, Marzolla M, Montesi D, Paolino C (2014) Large scale social network analysis. Large-scale data analytics. Springer, New York"},{"issue":"1\u20133","key":"241_CR1673","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1016\/j.tcs.2008.07.017","volume":"407","author":"M Latapy","year":"2008","unstructured":"Latapy M (2008) Main-memory triangle computations for very large (sparse (power-law)) graphs. Theor Comput Sci 407(1\u20133):458\u2013473. doi:10.1016\/j.tcs.2008.07.017","journal-title":"Theor Comput Sci"},{"issue":"19","key":"241_CR1674","doi-asserted-by":"crossref","first-page":"198701","DOI":"10.1103\/PhysRevLett.87.198701","volume":"87","author":"V Latora","year":"2001","unstructured":"Latora V, Marchiori M (2001) Efficient behavior of small- world networks. Phys Rev Lett 87(19): 198701","journal-title":"Phys Rev Lett"},{"key":"241_CR1675","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF02289146","volume":"14","author":"R Luce","year":"1949","unstructured":"Luce R, Perry A (1949) A method of matrix analysis of group structure. Psychometrika 14:95\u2013116. doi:10.1007\/BF02289146","journal-title":"Psychometrika"},{"issue":"1","key":"241_CR1676","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1142\/S0129626407002843","volume":"17","author":"A Lumsdaine","year":"2007","unstructured":"Lumsdaine A, Gregor D, Hendrickson B, Berry JW (2007) Challenges in parallel graph processing. Parallel Process Lett 17(1):5\u201320","journal-title":"Parallel Process Lett"},{"key":"241_CR1677","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.socnet.2004.11.009","volume":"27","author":"MEJ Newman","year":"2005","unstructured":"Newman MEJ (2005) A measure of betweenness centrality based on random walks. Soc Netw (27):39\u201354","journal-title":"Soc Netw"},{"key":"241_CR1678","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: an introduction","author":"MEJ Newman","year":"2010","unstructured":"Newman MEJ (2010) Networks: an introduction. Oxford University Press, Oxford"},{"unstructured":"NodeXL (2012) Nodexl, a graph visualization and manipulation software. \n                  http:\/\/nodexl.codeplex.com\n                  \n                , version 1.0.1.219","key":"241_CR1679"},{"issue":"2","key":"241_CR1680","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.socnet.2009.02.002","volume":"31","author":"T Opsahl","year":"2009","unstructured":"Opsahl T, Panzarasa P (2009) Clustering in weighted networks. Soc Netw 31(2): 155\u2014163. doi:10.1016\/j.socnet.2009.02.002","journal-title":"Soc Netw"},{"issue":"3","key":"241_CR1681","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/j.socnet.2010.03.006","volume":"32","author":"T Opsahl","year":"2010","unstructured":"Opsahl T, Agneessens F, Skvoretz J (2010) Node centrality in weighted networks: generalizing degree and shortest paths. Soc Netw 32(3):245\u2013251. doi:10.1016\/j.socnet.2010.03.006","journal-title":"Soc Netw"},{"issue":"4","key":"241_CR1682","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/0378-8733(80)90005-2","volume":"2","author":"ER Peay","year":"1980","unstructured":"Peay ER (1980) Connectedness in a general model for valued networks. Soc Netw 2(4):385\u2013410. doi: 10.1016\/0378\u20138733(80)90005\u20132","journal-title":"Soc Netw"},{"unstructured":"R Core Team (2012) R: a language and environment for statistical computing. R Foundation for Statistical Computing, Vienna. \n                  http:\/\/www.R-project.org\n                  \n                . ISBN 3\u2013900051-07\u20130","key":"241_CR1683"},{"key":"241_CR1684","volume-title":"Conversation practices and network structure in twitter","author":"L Rossi","year":"2012","unstructured":"Rossi L, Magnani M (2012) Conversation practices and network structure in twitter. In: ICWSM, Dublin"},{"key":"241_CR1685","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1007\/BF02289527","volume":"31","author":"G Sabidussi","year":"1966","unstructured":"Sabidussi G (1966) The centrality index of a graph. Psychometrika 31:581\u2013603. doi:10.1007\/BF02289527","journal-title":"Psychometrika"},{"unstructured":"SNAP (2011) Stanford network analysis project network analysis library. \n                  http:\/\/snap.stanford.edu\/snap\n                  \n                , version 2011\u201312-31","key":"241_CR1686"},{"key":"241_CR1687","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511815478","volume-title":"Social network analysis","author":"S Wasserman","year":"1994","unstructured":"Wasserman S, Faust K (1994) Social network analysis. Cambridge University Press, Cambridge"},{"key":"241_CR1688","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of \u2018small-world\u2019 networks. Nature 393:440\u2013442. doi:10.1038\/30918","journal-title":"Nature"},{"issue":"4","key":"241_CR1689","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0378-8733(94)90015-9","volume":"16","author":"DR White","year":"1994","unstructured":"White DR, Borgatti SP (1994) Betweenness centrality measures for directed graphs. Soc Netw 16(4): 335\u2013346","journal-title":"Soc Netw"}],"container-title":["Encyclopedia of Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4614-6170-8_241","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T22:21:47Z","timestamp":1591050107000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4614-6170-8_241"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9781461461692","9781461461708"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-1-4614-6170-8_241","relation":{},"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"5 October 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}