{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T07:25:07Z","timestamp":1770276307796,"version":"3.49.0"},"publisher-location":"New York, NY","reference-count":21,"publisher":"Springer New York","isbn-type":[{"value":"9781493971305","type":"print"},{"value":"9781493971312","type":"electronic"}],"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_299","type":"book-chapter","created":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T19:13:33Z","timestamp":1528744413000},"page":"928-941","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Gephi"],"prefix":"10.1007","author":[{"given":"S\u00e9bastien","family":"Heymann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,12]]},"reference":[{"key":"299_CR7137","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1038\/324446a0","volume":"324","author":"J Barnes","year":"1986","unstructured":"Barnes J, Hut P (1986) A hierarchical O(N log N) force-calculation algorithm. Nature 324:446\u2013449. ISSN 0028-0836","journal-title":"Nature"},{"key":"299_CR7138","doi-asserted-by":"crossref","unstructured":"Bastian M, Heymann S, Jacomy M (2009) Gephi: an open source software for exploring and manipulating networks. In: Proceedings of the third international AAAI conference on weblogs and social media (ICWSM\u201909), San Jose, pp 361\u2013362. American Journal of Sociology. http:\/\/www.aaai.org\/ocs\/index.php\/ICWSM\/09\/rt\/captureCite\/154\/0\/","DOI":"10.1609\/icwsm.v3i1.13937"},{"key":"299_CR7139","unstructured":"Bertin J (1999) S\u00e9miologie graphique: les diagrammes, les r\u00e9seaux, les cartes. Editions de l\u2019Ecole des Hautes Etudes en Sciences Sociales"},{"issue":"10","key":"299_CR7140","doi-asserted-by":"publisher","first-page":"1000","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"V Blondel","year":"2008","unstructured":"Blondel V, Guillaume J-L, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp 2008(10):1000","journal-title":"J Stat Mech Theory Exp"},{"issue":"3","key":"299_CR7141","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s11192-005-0255-6","volume":"64","author":"KW Boyack","year":"2005","unstructured":"Boyack KW, Klavans R, Brner K (2005) Mapping the backbone of science. Scientometrics 64(3):351\u2013374","journal-title":"Scientometrics"},{"key":"299_CR7142","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:163\u2013177","journal-title":"J Math Sociol"},{"key":"299_CR7143","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1177\/0539018408096447","volume":"47","author":"D Diminescu","year":"2008","unstructured":"Diminescu D (2008) The connected migrant: an epistemological manifest. Soc Sci Inf 47:565\u2013579","journal-title":"Soc Sci Inf"},{"key":"299_CR7144","unstructured":"Diminescu D, Bourgeois M, Renault M, Jacomy M (2011) Digital diasporas atlas exploration and cartography of diasporas in digital networks. In: Proceedings of the fifth international AAAI conference on weblogs and social media (ICWSM\u201911), Barcelona"},{"issue":"11","key":"299_CR7145","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"TMJ Fruchterman","year":"1991","unstructured":"Fruchterman TMJ, Reingold EM (1991) Graph drawing by force-directed placement. Softw Pract Exp 21(11):1129\u20131164","journal-title":"Softw Pract Exp"},{"key":"299_CR7146","unstructured":"Fry B (2004) Computational information design. Ph.D. thesis, MIT Media Lab"},{"key":"299_CR7147","first-page":"37","volume":"10","author":"YF Hu","year":"2005","unstructured":"Hu YF (2005) Efficient and high quality force-directed graph drawing. Math J 10:37\u201371","journal-title":"Math J"},{"issue":"5","key":"299_CR7148","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"J Kleinberg","year":"1999","unstructured":"Kleinberg J (1999) Authoritative sources in a hyperlinked environment. J ACM 46(5):604\u2013632","journal-title":"J ACM"},{"key":"299_CR7149","volume-title":"The Stanford graphbase: a platform for combinatorial computing","author":"DE Knuth","year":"1993","unstructured":"Knuth DE (1993) The Stanford graphbase: a platform for combinatorial computing. Addison-Wesley, Reading"},{"key":"299_CR7150","unstructured":"Kobourov SG (to appear in 2012) Force-directed drawing algorithms. In: Tamassia R (ed) Handbook of graph drawing and visualization. CRC. http:\/\/www.crcpress.com\/product\/isbn\/9781584884125"},{"issue":"1\u20133","key":"299_CR7151","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\u20133):458\u2013473","journal-title":"Theor Comput Sci"},{"key":"299_CR7152","doi-asserted-by":"crossref","unstructured":"Martin S, Brown WM, Klavans R, Boyack K (2011) OpenOrd: an open-source toolbox for large graph layout. In: SPIE conference on visualization and data analysis (VDA), Denver","DOI":"10.1117\/12.871402"},{"key":"299_CR7153","unstructured":"Page L, Brin S, Motwani R, Winograd T (1999) The pagerank citation ranking: bringing order to the web. Technical report. Stanford InfoLab"},{"key":"299_CR7154","doi-asserted-by":"crossref","unstructured":"Ratkiewicz J, Conover M, Meiss M, Gon\u00e7alves B, Patil S, Flammini A, Menczer F (2011) Truthy: mapping the spread of astroturf in microblog streams. In: Proceedings of the 20th international conference companion on world wide web (WWW\u201911), Lyon","DOI":"10.1145\/1963192.1963301"},{"key":"299_CR7155","doi-asserted-by":"publisher","first-page":"e23176","DOI":"10.1371\/journal.pone.0023176","volume":"6","author":"J Stehl\u00e9","year":"2011","unstructured":"Stehl\u00e9 J, Voirin N, Barrat A, Cattuto C, Isella L, Pinton J-F, Quaggiotto M, Van den Broeck W, Rgis C, Lina B, Vanhems P (2011) High-resolution measurements of face-to-face contact patterns in a primary school. PLoS One 6:e23176. http:\/\/www.plosone.org\/article\/info%3Adoi%2F10.1371%2Fjournal.pone.0023176","journal-title":"PLoS One"},{"issue":"2","key":"299_CR7156","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan R (1972) Depth-first search and linear graph algorithms. SIAM J Comput 1(2):146\u2013160","journal-title":"SIAM J Comput"},{"key":"299_CR7157","volume-title":"Exploratory data analysis","author":"J Tukey","year":"1977","unstructured":"Tukey J (1977) Exploratory data analysis, 1st edn. Addison-Wesley, Reading","edition":"1"}],"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_299","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,3]],"date-time":"2023-09-03T04:00:14Z","timestamp":1693713614000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4939-7131-2_299"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9781493971305","9781493971312"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-7131-2_299","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"}}]}}