{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:12:44Z","timestamp":1743016364026,"version":"3.40.3"},"publisher-location":"New York, NY","reference-count":40,"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_44","type":"book-chapter","created":{"date-parts":[[2014,10,4]],"date-time":"2014-10-04T14:49:05Z","timestamp":1412434145000},"page":"2328-2336","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Visualization of Large Networks"],"prefix":"10.1007","author":[{"given":"Yifan","family":"Hu","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,10,5]]},"reference":[{"key":"44_CR2272","volume-title":"Proceedings of the 14th Pacific-Asia conference on advances in knowledge discovery and data mining (PAKDD 2010)","author":"L Akoglu","year":"2010","unstructured":"Akoglu L, McGlohon M, Faloutsos C (2010) Oddball: spotting anomalies in weighted graphs. In: Proceedings of the 14th Pacific-Asia conference on advances in knowledge discovery and data mining (PAKDD 2010), Hyderabad"},{"key":"44_CR2273","doi-asserted-by":"crossref","first-page":"2325","DOI":"10.1109\/TVCG.2011.234","volume":"9","author":"B Alper","year":"2011","unstructured":"Alper B, Hollerer T, Kuchera-Morin J, Forbes A (2011) Stereoscopic highlighting: 2D graph visualization on stereo displays. IEEE Trans Vis Comput Graph 9:2325\u20132333","journal-title":"IEEE Trans Vis Comput Graph"},{"key":"44_CR2274","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1038\/324446a0","volume":"324","author":"J Barnes","year":"1986","unstructured":"Barnes J, Hut P (1986) A hierarchical O(N logN) force-calculation algorithm. Nature 324:446\u2013449","journal-title":"Nature"},{"key":"44_CR2275","doi-asserted-by":"crossref","unstructured":"Brandes U, Mader M (2012) A quantitative comparison of stress-minimization approaches for offline dynamic graph drawing. In: Proceedings of the 19th international symposium on graph drawing (GD'11). Eindhoven, pp 99\u2013110","DOI":"10.1007\/978-3-642-25878-7_11"},{"key":"44_CR2276","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1007\/978-3-540-70904-6_6","volume":"4372","author":"U Brandes","year":"2007","unstructured":"Brandes U, Pich C (2007) Eigensolver methods for progressive multidimensional scaling of large data. In: Proceedings of the 14th international symposium on graph drawing (GD'06, Karlsruhe). Lecture notes in computer science, vol. 4372. pp 42\u201353","journal-title":"Lecture notes in computer science"},{"key":"44_CR2277","first-page":"1","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis TA, Hu Y (2011) The University of Florida sparse matrix collection. ACM Trans Math Softw 38:1\u201325","journal-title":"ACM Trans Math Softw"},{"key":"44_CR2278","volume-title":"Algorithms for the visualization of graphs","author":"G Di Battista","year":"1999","unstructured":"Di Battista G, Eades P, Tamassia R, Tollis IG (1999) Algorithms for the visualization of graphs. Prentice-Hall, Upper Saddle River"},{"key":"44_CR2279","first-page":"149","volume":"42","author":"P Eades","year":"1984","unstructured":"Eades P (1984) A heuristic for graph drawing. Congr Numerantium 42:149\u2013160","journal-title":"Congr Numerantium"},{"key":"44_CR2280","doi-asserted-by":"crossref","first-page":"1310","DOI":"10.1109\/TVCG.2007.70580","volume":"13","author":"Y Frishman","year":"2007","unstructured":"Frishman Y, Tal A (2007) Multi-level graph layout on the GPU. J IEEE Trans Vis Comput Graph 13:1310\u20131319","journal-title":"J IEEE Trans Vis Comput Graph"},{"key":"44_CR2281","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1109\/TVCG.2008.11","volume":"14","author":"Y Frishman","year":"2008","unstructured":"Frishman Y, Tal A (2008) Online dynamic graph drawing. In: Proceedings of the Eurographics\/IEEE VGTC symposium on visualization (EuroVis), JIEEE Trans Vis Comput Graph 14:727\u2013740","journal-title":"JIEEE Trans Vis Comput Graph"},{"key":"44_CR2282","doi-asserted-by":"crossref","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:1129\u20131164","journal-title":"Softw Pract Exp"},{"key":"44_CR2283","volume-title":"Proceedings of the IEEE pacific visualization symposium","author":"ER Gansner","year":"2011","unstructured":"Gansner ER, Hu Y, North S, Scheidegger C (2011) Multilevel agglomerative edge bundling for visualizing large graphs. In: Proceedings of the IEEE pacific visualization symposium, Hong Kong"},{"key":"44_CR2284","volume-title":"Proceedings of the 5th IEEE pacific visualization symposium","author":"ER Gansner","year":"2012","unstructured":"Gansner ER, Hu Y, North S (2012) A Maxent-stress model for graph layout. In: Proceedings of the 5th IEEE pacific visualization symposium, Songdo"},{"key":"44_CR2285","first-page":"239","volume-title":"Proceedings of the 12th international symposium on graph drawing (GD'04)","author":"ER Gansner","year":"2004","unstructured":"Gansner ER, Koren Y, North SC (2004) Graph drawing by stress majorization. In: Proceedings of the 12th international symposium on graph drawing (GD'04). Lecture notes in computer science, vol 3383. Springer, Berlin\/New York, pp 239\u2013250"},{"key":"44_CR2286","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1109\/32.221135","volume":"19","author":"ER Gansner","year":"1993","unstructured":"Gansner ER, Koutsofios E, North S, Vo KP (1993) A technique for drawing directed graphs. IEEE Trans Softw Eng 19:214\u2013230","journal-title":"IEEE Trans Softw Eng"},{"key":"44_CR2287","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5750.001.0001","volume-title":"The rapid evaluation of potential fields in particle systems","author":"LF Greengard","year":"1988","unstructured":"Greengard LF (1988) The rapid evaluation of potential fields in particle systems. MIT, Cambridge\/Massachusetts"},{"key":"44_CR2288","first-page":"285","volume-title":"Proceedings of the 12th international symposium on graph drawing (GD'04, New York). Lecture notes in computer science","author":"S Hachul","year":"2004","unstructured":"Hachul S, Junger M (2004) Drawing large graphs with a potential field based multilevel algorithm. In: Proceedings of the 12th international symposium on graph drawing (GD'04, New York). Lecture notes in computer science, vol 3383. Springer, Heidelberg, pp 285\u2013 295"},{"key":"44_CR2289","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1287\/mnsc.17.3.219","volume":"17","author":"KM Hall","year":"1970","unstructured":"Hall KM (1970) An r-dimensional quadratic placement algorithm. Manag Sci 17:219\u2013229","journal-title":"Manag Sci"},{"key":"44_CR2290","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/3-540-36151-0_20","volume":"2528","author":"D Harel","year":"2002","unstructured":"Harel D, Koren Y (2002) Graph drawing by high-dimensional embedding. Lect Notes Comput Sci 2528:207\u2013219","journal-title":"Lect Notes Comput Sci"},{"key":"44_CR2291","doi-asserted-by":"crossref","first-page":"1302","DOI":"10.1109\/TVCG.2007.70582","volume":"13","author":"N Henry","year":"2007","unstructured":"Henry N, Fekete JD, McGuffin MJ (2007) NodeTrix: a hybrid visualization of social networks. IEEE Trans Vis Comput Graph Arch 13:1302\u20131309","journal-title":"IEEE Trans Vis Comput Graph Arch"},{"key":"44_CR2292","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1111\/j.1467-8659.2009.01450.x","volume":"28","author":"D Holten","year":"2009","unstructured":"Holten D, van Wijk JJ (2009) Force-directed edge bundling for graph visualization. Comput Graph Forum 28:983\u2013990","journal-title":"Comput Graph Forum"},{"key":"44_CR2293","first-page":"37","volume":"10","author":"Y Hu","year":"2005","unstructured":"Hu Y (2005) Efficient and high quality force-directed graph drawing. Math J 10:37\u201371","journal-title":"Math J"},{"key":"44_CR2294","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1109\/MCG.2010.101","volume":"30","author":"Y Hu","year":"2010","unstructured":"Hu Y, Gansner ER, Kobourov SG (2010) Visualizing graphs and clusters as maps. IEEE Comput Graph Appl 30:54\u201366","journal-title":"IEEE Comput Graph Appl"},{"key":"44_CR2295","doi-asserted-by":"crossref","first-page":"2364","DOI":"10.1109\/TVCG.2011.223","volume":"17","author":"C Hurter","year":"2011","unstructured":"Hurter C, Paulovich FV, Cantareiro G, Telea A (2011) Skeleton-based edge bundling for graph visualization. IEEE Trans Vis Comput Graph 17:2364\u20132373","journal-title":"IEEE Trans Vis Comput Graph"},{"key":"44_CR2296","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1109\/TVCG.2008.85","volume":"15","author":"S Ingram","year":"2009","unstructured":"Ingram S, Munzner T, Olano M (2009) Glimmer: multilevel MDS on the GPU. IEEE Trans Vis Comput Graph 15:249\u2013261","journal-title":"IEEE Trans Vis Comput Graph"},{"key":"44_CR2297","doi-asserted-by":"crossref","first-page":"1285","DOI":"10.1109\/TVCG.2008.151","volume":"14","author":"Y Jia","year":"2008","unstructured":"Jia Y, Hberock J, Garland M, Hart J (2008) On the visualization of social and other scale-free networks. IEEE Trans Vis Comput 14:1285\u20131292","journal-title":"IEEE Trans Vis Comput"},{"key":"44_CR2298","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0020-0190(89)90102-6","volume":"31","author":"T Kamada","year":"1989","unstructured":"Kamada T, Kawai S (1989) An algorithm for drawing general undirected graphs. Inf Process Lett 31:7\u201315","journal-title":"Inf Process Lett"},{"key":"44_CR2299","doi-asserted-by":"crossref","first-page":"975","DOI":"10.1111\/j.1467-8659.2012.03090.x","volume":"31","author":"M Khoury","year":"2012","unstructured":"Khoury M, Hu Y, Krishnan S, Scheidegger C (2012) Drawing large graph by low-rank stress majorization. Comput Graph Forum 31:975\u2013984","journal-title":"Comput Graph Forum"},{"key":"44_CR22100","first-page":"137","volume-title":"Proceedings of the IEEE symposium on information visualization (InfoVis'02, Boston)","author":"Y Koren","year":"2002","unstructured":"Koren Y, Carmel L, Harel D (2002) Ace: a fast multiscale eigenvectors computation for drawing huge graphs. In: Proceedings of the IEEE symposium on information visualization (InfoVis'02, Boston). IEEE Computer Society, Washington, pp 137\u2013144"},{"key":"44_CR22101","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1080\/15427951.2009.10129177","volume":"6","author":"J Leskovec","year":"2009","unstructured":"Leskovec J, Lang K, Dasgupta A, Mahoney M (2009) Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters. Internet Math 6:29\u2013123","journal-title":"Internet Math"},{"key":"44_CR22102","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1006\/jvlc.1995.1010","volume":"6","author":"K Misue","year":"1995","unstructured":"Misue K, Eades P, Lai W, Sugiyama K (1995) Layout adjustment and the mental map. J Vis Lang Comput 6:183\u2013210","journal-title":"J Vis Lang Comput"},{"key":"44_CR22103","first-page":"90","volume-title":"Proceedings of the 16th international symposium on graph drawing (GD'05, Passau)","author":"B Monien","year":"1995","unstructured":"Monien B, Ramme F, Salmen H (1995) A parallel simulated annealing algorithm for generating 3D layouts of undirected graphs. In: Proceedings of the 16th international symposium on graph drawing (GD'05, Passau). Springer, Heidelberg, pp 90\u2013101"},{"key":"44_CR22104","doi-asserted-by":"crossref","first-page":"2319","DOI":"10.1145\/1518701.1519056","volume-title":"Proceedings of the SIGCHI conference on human factors in computing systems (CHI'09, Boston)","author":"T Moscovich","year":"2009","unstructured":"Moscovich T, Chevalier F, Henry N, Pietriga E, Fekete J-D (2009) Topology-aware navigation in large networks. In: Proceedings of the SIGCHI conference on human factors in computing systems (CHI'09, Boston). ACM, New York, pp 2319\u20132328"},{"key":"44_CR22105","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/978-3-540-70904-6_33","volume":"4372","author":"C Papadopoulos","year":"2007","unstructured":"Papadopoulos C, Voglis C (2007) Drawing graphs using modular decomposition. In: Proceedings of the 13th international symposium on graph drawing (GD'06, Karlsruhe). Lecture notes in computer science, vol 4372. pp 343\u2013354","journal-title":"Lecture notes in computer science"},{"key":"44_CR22106","volume-title":"Large scale relational information visualization, clustering, and abstraction","author":"A Quigley","year":"2001","unstructured":"Quigley A (2001) Large scale relational information visualization, clustering, and abstraction. PhD thesis, Department of Computer Science and Software Engineering, University of Newcastle, Newcastle"},{"issue":"2","key":"44_CR22107","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"11","author":"K Sugiyama","year":"1981","unstructured":"Sugiyama K, Tagawa S, Toda M (1981) Methods for visual understanding of hierarchical systems. IEEE Trans Syst Man Cybernet (SMC) 11(2):109\u2013125","journal-title":"IEEE Trans Syst Man Cybernet (SMC)"},{"key":"44_CR22108","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BF02288916","volume":"17","author":"WS Torgerson","year":"1952","unstructured":"Torgerson WS (1952) Multidimensional scaling: I. Theory and method. Psychometrika 17:401\u2013419","journal-title":"Psychometrika"},{"key":"44_CR22109","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"13","author":"W Tutte","year":"1963","unstructured":"Tutte W (1963) How to draw a graph. Proc Lond Math Soc 13:743\u2013768","journal-title":"Proc Lond Math Soc"},{"key":"44_CR22110","doi-asserted-by":"crossref","first-page":"975","DOI":"10.1111\/j.1467-8659.2008.01232.x","volume":"27","author":"F van Ham","year":"2008","unstructured":"van Ham F, Wattenberg M (2008) Centrality based visualization of small world graphs. Comput Graph Forum 27:975\u2013982","journal-title":"Comput Graph Forum"},{"key":"44_CR22111","doi-asserted-by":"crossref","first-page":"253","DOI":"10.7155\/jgaa.00070","volume":"7","author":"C Walshaw","year":"2003","unstructured":"Walshaw C (2003) A multilevel algorithm for force-directed graph drawing. J Graph Algorithms Appl 7:253\u2013285","journal-title":"J Graph Algorithms Appl"}],"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_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,18]],"date-time":"2022-04-18T23:46:26Z","timestamp":1650325586000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4614-6170-8_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9781461461692","9781461461708"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-1-4614-6170-8_44","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"}}]}}