{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:44:09Z","timestamp":1742989449438,"version":"3.40.3"},"publisher-location":"New York, NY","reference-count":46,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781493971305"},{"type":"electronic","value":"9781493971312"}],"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-1-4939-7131-2_241","type":"book-chapter","created":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T19:21:24Z","timestamp":1528744884000},"page":"1751-1765","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"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":[[2018,6,12]]},"reference":[{"key":"241_CR1667","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1090\/S0273-0979-06-01130-X","volume":"43","author":"GL Alexanderson","year":"2006","unstructured":"Alexanderson GL (2006) About the cover: Euler and K\u00f6nigsberg\u2019s bridges: a historical view. Bull Am Math Soc 43:567\u2013573. https:\/\/doi.org\/10.1090\/S0273-0979-06-01130-X","journal-title":"Bull Am Math Soc"},{"key":"241_CR1668","unstructured":"Anthonisse JM (1971) The rush in a directed graph. Technical report BN 9\/71, Stichting Mathematisch Centrum, Amsterdam"},{"key":"241_CR1669","unstructured":"Bacon Oracle (2016) The Oracle of Bacon. https:\/\/oracleofbacon.org\/. Accessed 11 Nov 2016"},{"key":"241_CR1670","doi-asserted-by":"crossref","unstructured":"Bastian M, Heymann S, Jacomy M (2009) Gephi: an open source software for exploring and manipulating networks. http:\/\/www.aaai.org\/ocs\/index.php\/ICWSM\/09\/paper\/view\/154","DOI":"10.1609\/icwsm.v3i1.13937"},{"issue":"1","key":"241_CR1671","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1086\/386272","volume":"110","author":"PS Bearman","year":"2004","unstructured":"Bearman PS, Moody J, Stovel K (2004) Chains of affection: the structure of adolescent romantic and sexual networks. Am J Sociol 110(1):44\u201391. https:\/\/doi.org\/10.1086\/386272","journal-title":"Am J Sociol"},{"key":"241_CR1672","doi-asserted-by":"publisher","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 \u201808. ACM, New York, pp 16\u201324. https:\/\/doi.org\/10.1145\/1401890.1401898","DOI":"10.1145\/1401890.1401898"},{"issue":"2","key":"241_CR1673","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1080\/0022250X.2001.9990249","journal-title":"J Math Sociol"},{"issue":"07","key":"241_CR1674","doi-asserted-by":"publisher","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 Bifurcation Chaos 17(07):2303\u20132318. https:\/\/doi.org\/10.1142\/S0218127407018403","journal-title":"Int J Bifurcation Chaos"},{"key":"241_CR1675","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 Press, Cambridge, MA","edition":"3"},{"issue":"1","key":"241_CR1676","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1080\/00018730601170527","volume":"56","author":"LF Costa","year":"2007","unstructured":"Costa LF, Rodrigues FA, Travieso G, Villas Boas PR (2007) Characterization of complex networks: a survey of measurements. Adv Phys 56(1):167\u2013242. https:\/\/doi.org\/10.1080\/00018730601170527","journal-title":"Adv Phys"},{"key":"241_CR1677","unstructured":"Csardi G, Nepusz T (2006) The igraph software package for complex network research. Inter J Complex Syst 1695. http:\/\/igraph.org\/"},{"key":"241_CR1678","unstructured":"Erd\u0151s Number Project (2006) The Erd\u0151s number project at Oakland University. https:\/\/oakland.edu\/enp\/. Accessed 26 Nov 2016"},{"key":"241_CR1679","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1007\/978-0-387-30165-5_8"},{"issue":"6","key":"241_CR1680","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1145\/367766.368168","journal-title":"Commun ACM"},{"issue":"3\u20135","key":"241_CR1681","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1016\/j.physrep.2009.11.002","journal-title":"Phys Rep"},{"issue":"1","key":"241_CR1682","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.2307\/3033543","journal-title":"Sociometry"},{"issue":"3","key":"241_CR1683","doi-asserted-by":"publisher","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 Networks 1(3):215\u2013239. https:\/\/doi.org\/10.1016\/0378-8733(78)90021-7","journal-title":"Soc Networks"},{"issue":"8","key":"241_CR1684","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1371\/journal.pone.0022656","journal-title":"PLoS ONE"},{"issue":"12","key":"241_CR1685","doi-asserted-by":"publisher","first-page":"2030","DOI":"10.14778\/2367502.2367570","volume":"5","author":"S Guha","year":"2012","unstructured":"Guha S, McGregor A (2012) Graph synopses, sketches, and streams: a survey. Proc VLDB Endow 5(12):2030\u20132031. https:\/\/doi.org\/10.14778\/2367502.2367570","journal-title":"Proc VLDB Endow"},{"key":"241_CR1686","doi-asserted-by":"publisher","DOI":"10.21236\/AD0705364","volume-title":"Graph theory","author":"F Harary","year":"1969","unstructured":"Harary F (1969) Graph theory. Addison-Wesley, Reading"},{"key":"241_CR1687","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"},{"issue":"1","key":"241_CR1688","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1145\/321992.321993","journal-title":"J ACM"},{"key":"241_CR1689","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-1-4614-9242-9 6","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. In: Gkoulalas-Divanis A, Labbi A (eds) Large-scale data analytics. Springer, New York, pp 155\u2013187. https:\/\/doi.org\/10.1007\/978-1-4614-9242-9 6"},{"issue":"1","key":"241_CR1690","doi-asserted-by":"publisher","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):458\u2013473. https:\/\/doi.org\/10.1016\/j.tcs.2008.07.017","journal-title":"Theor Comput Sci"},{"key":"241_CR1691","doi-asserted-by":"publisher","first-page":"198,701","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:198,701. https:\/\/doi.org\/10.1103\/PhysRevLett.87.198701","journal-title":"Phys Rev Lett"},{"issue":"1","key":"241_CR1692","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0960-0779(03) 00429-6","volume":"20","author":"V Latora","year":"2004","unstructured":"Latora V, Marchiori M (2004) How the science of complex networks can help developing strategies against terrorism. Chaos, Solitons Fractals 20(1):69\u201375. https:\/\/doi.org\/10.1016\/S0960-0779(03) 00429-6","journal-title":"Chaos, Solitons Fractals"},{"issue":"1","key":"241_CR1693","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/2898361","volume":"8","author":"J Leskove\u010d","year":"2016","unstructured":"Leskove\u010d J, Sosi\u02c7\u010d R (2016) Snap: a general-purpose network analysis and graph-mining library. ACM Trans Intell Syst Technol 8(1):20. https:\/\/doi.org\/10.1145\/2898361","journal-title":"ACM Trans Intell Syst Technol"},{"key":"241_CR1694","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1007\/BF02289146","journal-title":"Psychometrika"},{"issue":"1","key":"241_CR1695","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1142\/S0129626407002843","journal-title":"Parallel Process Lett"},{"issue":"Suppl 2","key":"241_CR1696","doi-asserted-by":"publisher","first-page":"S186","DOI":"10.1098\/rsbl.2003.0057","volume":"270","author":"D Lusseau","year":"2003","unstructured":"Lusseau D (2003) The emergent properties of a dolphin social network. Proc R Soc Lond B Biol Sci 270(Suppl 2):S186\u2013S188. https:\/\/doi.org\/10.1098\/rsbl.2003.0057","journal-title":"Proc R Soc Lond B Biol Sci"},{"issue":"489","key":"241_CR1697","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1198\/jasa.2009.ap08518","volume":"105","author":"TH McCormick","year":"2010","unstructured":"McCormick TH, Salganik MJ, Zheng T (2010) How many people do you know?: efficiently estimating personal network size. J Am Stat Assoc 105(489):59\u201370. https:\/\/doi.org\/10.1198\/jasa.2009.ap08518","journal-title":"J Am Stat Assoc"},{"key":"241_CR1698","doi-asserted-by":"publisher","DOI":"10.1037\/10648-000","volume-title":"Who shall survive? A new approach to the problem of human Interrelations","author":"JL Moreno","year":"1934","unstructured":"Moreno JL (1934) Who shall survive? A new approach to the problem of human Interrelations. Nervous and Mental Disease Publishing Co., Washington, DC"},{"issue":"2","key":"241_CR1699","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1073\/pnas.98.2.404","volume":"98","author":"MEJ Newman","year":"2001","unstructured":"Newman MEJ (2001) The structure of scientific collaboration networks. Proc Natl Acad Sci U S A 98(2):404\u2013409. https:\/\/doi.org\/10.1073\/pnas.98.2.404","journal-title":"Proc Natl Acad Sci U S A"},{"issue":"1","key":"241_CR16100","doi-asserted-by":"publisher","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 Networks 27(1):39\u201354. https:\/\/doi.org\/10.1016\/j.socnet.2004.11.009","journal-title":"Soc Networks"},{"key":"241_CR16101","doi-asserted-by":"publisher","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"},{"key":"241_CR16102","unstructured":"NodeXL (2012) Nodexl, a graph visualization and manipulation software. http:\/\/nodexl.codeplex.com. Accessed 6 Dec 2016"},{"issue":"2","key":"241_CR16103","doi-asserted-by":"publisher","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 Networks 31(2):155\u2013163. https:\/\/doi.org\/10.1016\/j.socnet.2009.02.002","journal-title":"Soc Networks"},{"issue":"3","key":"241_CR16104","doi-asserted-by":"publisher","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 Networks 32(3):245\u2013251. https:\/\/doi.org\/10.1016\/j.socnet.2010.03.006","journal-title":"Soc Networks"},{"issue":"4","key":"241_CR16105","doi-asserted-by":"publisher","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 Networks 2(4):385\u2013410. https:\/\/doi.org\/10.1016\/0378-8733(80)90005-2","journal-title":"Soc Networks"},{"key":"241_CR16106","unstructured":"R Core Team (2012) R: a language and environment for statistical computing. R Foundation for Statistical Computing, Vienna. http:\/\/www.R-project.org. ISBN:3-900051-07-0"},{"key":"241_CR16107","unstructured":"Rossi L, Magnani M (2012) Conversation practices and network structure in twitter. https:\/\/www.aaai.org\/ocs\/index.php\/ICWSM\/ICWSM12\/paper\/view\/4634"},{"issue":"4","key":"241_CR16108","doi-asserted-by":"publisher","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(4):581\u2013603. https:\/\/doi.org\/10.1007\/ BF02289527","journal-title":"Psychometrika"},{"key":"241_CR16109","doi-asserted-by":"publisher","unstructured":"Wang Y, Davidson A, Pan Y, Wu Y, Riffel A, Owens JD (2016) Gunrock: a high-performance graph processing library on the GPU. In: Proceedings of 21st ACM SIGPLAN symposium on principles and practice of parallel programming, PPoPP \u201816. ACM, New York, pp 11:1\u201311:12. https:\/\/doi.org\/10.1145\/2851141.2851145","DOI":"10.1145\/2851141.2851145"},{"key":"241_CR16110","doi-asserted-by":"publisher","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, New York"},{"key":"241_CR16111","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of \u201csmall-world\u201d networks. Nature 393:440\u2013442. https:\/\/doi.org\/10.1038\/30918","journal-title":"Nature"},{"issue":"4","key":"241_CR16112","doi-asserted-by":"publisher","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 Networks 16(4):335\u2013346. https:\/\/doi.org\/10.1016\/0378-8733(94)90015-9","journal-title":"Soc Networks"}],"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-4939-7131-2_241","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,3]],"date-time":"2023-09-03T04:00:23Z","timestamp":1693713623000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4939-7131-2_241"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9781493971305","9781493971312"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-7131-2_241","relation":{},"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"12 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}