{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:31:14Z","timestamp":1743010274778,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319639628"},{"type":"electronic","value":"9783319639628"}],"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-3-319-63962-8_324-1","type":"book-chapter","created":{"date-parts":[[2018,3,12]],"date-time":"2018-03-12T05:22:54Z","timestamp":1520832174000},"page":"1-9","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Graph Visualization"],"prefix":"10.1007","author":[{"given":"Yifan","family":"Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,20]]},"reference":[{"key":"324-1_CR1","doi-asserted-by":"crossref","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)","DOI":"10.1007\/978-3-642-13672-6_40"},{"issue":"C","key":"324-1_CR2","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/j.ins.2015.04.017","volume":"330","author":"D Archambault","year":"2016","unstructured":"Archambault D, Purchase HC (2016) Can animation support the visualisation of dynamic graphs? Inf Sci 330(C):495\u2013509","journal-title":"Inf Sci"},{"key":"324-1_CR3","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-45848-4_3","volume-title":"Graph drawing (GD\u201901)","author":"U Brandes","year":"2002","unstructured":"Brandes U, Kpf B (2002) Fast and simple horizontal coordinate assignment. In: Mutzel P, Jnger M, Leipert S (eds) Graph drawing (GD\u201901). LNCS, vol 2265. Springer, Berlin\/Heidelberg, pp 31\u201344"},{"key":"324-1_CR4","unstructured":"Brandes U, Pich C (2007) Eigensolver methods for progressive multidimensional scaling of large data. In: Proceeding of the 14th international symposium graph drawing (GD\u201906). LNCS, vol 4372, pp 42\u201353"},{"key":"324-1_CR5","doi-asserted-by":"crossref","unstructured":"Chimani M, Hungerlnder P, Jnger M, Mutzel P (2011) An SDP approach to multi-level crossing minimization. In: Algorithm engineering and experiments (ALENEX\u201911), pp 116\u2013126","DOI":"10.1137\/1.9781611972917.12"},{"key":"324-1_CR6","first-page":"1","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis TA, Hu Y (2011) University of Florida sparse matrix collection. ACM Trans Math Softw 38:1\u201318","journal-title":"ACM Trans Math Softw"},{"key":"324-1_CR7","volume-title":"Algorithms for the visualization of graphs","author":"G Battista Di","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":"324-1_CR8","first-page":"223","volume-title":"Handbook of graph drawing and visualization","author":"CA Duncan","year":"2013","unstructured":"Duncan CA, Goodrich MT (2013) Planar orthogonal and polyline drawing algorithms, chap 7. In: Tamassia R (ed) Handbook of graph drawing and visualization. CRC Press, Hoboken, pp 223\u2013246"},{"key":"324-1_CR9","first-page":"149","volume":"42","author":"P Eades","year":"1984","unstructured":"Eades P (1984) A heuristic for graph drawing. Congressus Numerantium 42:149\u2013160","journal-title":"Congressus Numerantium"},{"key":"324-1_CR10","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01187020","volume":"11","author":"P Eades","year":"1994","unstructured":"Eades P, Wormald NC (1994) Edge crossings in drawings of bipartite graphs. Algorithmica 11:379\u2013403","journal-title":"Algorithmica"},{"issue":"6","key":"324-1_CR11","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0020-0190(93)90079-O","volume":"47","author":"P Eades","year":"1993","unstructured":"Eades P, Lin X, Smyth WF (1993) A fast and effective heuristic for the feedback arc set problem. Inf Process Lett 47(6):319\u2013323","journal-title":"Inf Process Lett"},{"key":"324-1_CR12","unstructured":"Frishman Y, Tal A (2007) Online dynamic graph drawing. In: Proceeding of eurographics\/IEEE VGTC symposium on visualization (EuroVis), pp 75\u201382"},{"key":"324-1_CR13","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 Prac Exp 21:1129\u20131164","journal-title":"Softw Prac Exp"},{"issue":"3","key":"324-1_CR14","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1109\/32.221135","volume":"19","author":"ER Gansner","year":"1993","unstructured":"Gansner ER, Koutsofios E, North SC, Vo KP (1993) A technique for drawing directed graphs. IEEE Trans Softw Eng 19(3):214\u2013230","journal-title":"IEEE Trans Softw Eng"},{"key":"324-1_CR15","unstructured":"Gansner ER, Koren Y, North SC (2004) Graph drawing by stress majorization. In: Proceeding of the 12th international symposium on graph drawing (GD\u201904). LNCS. vol 3383. Springer, pp 239\u2013250"},{"issue":"6","key":"324-1_CR16","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1109\/TVCG.2012.299","volume":"19","author":"ER Gansner","year":"2013","unstructured":"Gansner ER, Hu Y, North SC (2013) A maxent-stress model for graph layout. IEEE Trans Vis Comput Graph 19(6):927\u2013940","journal-title":"IEEE Trans Vis Comput Graph"},{"key":"324-1_CR17","unstructured":"Hachul S, J\u00fcnger M (2004) Drawing large graphs with a potential field based multilevel algorithm. In: Proceeding of the 12th international symposium graph drawing (GD\u201904). LNCS, vol 3383. Springer, pp 285\u2013295"},{"key":"324-1_CR18","first-page":"409","volume-title":"Handbook of graph drawing and visualization, chap 13","author":"P Healy","year":"2014","unstructured":"Healy P, Nikolov NS (2014) Hierarchical drawing algorithms. In: Tamassia R (ed) Handbook of graph drawing and visualization, chap 13. CRC Press, Boca Raton, pp 409\u2013454"},{"key":"324-1_CR19","doi-asserted-by":"publisher","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 13:1302\u20131309","journal-title":"IEEE Trans Vis Comput Graph"},{"key":"324-1_CR20","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":"324-1_CR21","doi-asserted-by":"publisher","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"},{"issue":"1","key":"324-1_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00001","volume":"1","author":"M J\u00fcnger","year":"1997","unstructured":"J\u00fcnger M, Mutzel P (1997) 2-layer straightline crossing minimization: performance of exact and heuristic algorithms. J Graph Algorithms Appl 1(1):1\u201325","journal-title":"J Graph Algorithms Appl"},{"key":"324-1_CR23","doi-asserted-by":"publisher","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. Inform Process Lett 31: 7\u201315","journal-title":"Inform Process Lett"},{"key":"324-1_CR24","doi-asserted-by":"crossref","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW, Bohlinger JD (eds) Complexity of computer computations, pp 85\u2013103.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"324-1_CR25","doi-asserted-by":"crossref","unstructured":"Kerren A, Purchase H, Ward MO (eds) (2014) Multivariate network visualization: Dagstuhl seminar # 13201, Dagstuhl Castle, 12\u201317 May 2013. Revised discussions, Lecture notes in computer science, vol 8380, Springer, Cham","DOI":"10.1007\/978-3-319-06793-3"},{"key":"324-1_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02289565","volume":"29","author":"JB Kruskal","year":"1964","unstructured":"Kruskal JB (1964) Multidimensioal scaling by optimizing goodness of fit to a nonmetric hypothesis. Psychometrika 29:1\u201327","journal-title":"Psychometrika"},{"key":"324-1_CR27","unstructured":"Kruskal JB, Seery JB (1980) Designing network diagrams. In: Proceedings of the first general conference on social graphics, U.S. Department of the Census, Washington, DC, pp 22\u201350, Bell laboratories technical report no. 49"},{"issue":"3","key":"324-1_CR28","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1111\/j.1467-8659.2008.01232.x","volume":"27","author":"F Ham van","year":"2008","unstructured":"van Ham F, Wattenberg M (2008) Centrality based visualization of small world graphs. Comput Graph Forum 27(3):975\u2013982","journal-title":"Comput Graph Forum"},{"issue":"6","key":"324-1_CR29","doi-asserted-by":"publisher","first-page":"1719","DOI":"10.1111\/j.1467-8659.2011.01898.x","volume":"30","author":"T Landesberger von","year":"2011","unstructured":"von Landesberger T, Kuijper A, Schreck T, Kohlhammer J, van Wijk JJ, Fekete JD, Fellner DW (2011) Visual analysis of large graphs: state-of-the-art and future research challenges. Comput Graph Forum 30(6): 1719\u20131749","journal-title":"Comput Graph Forum"},{"key":"324-1_CR30","doi-asserted-by":"publisher","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":"324-1_CR31","first-page":"2319","volume-title":"CHI \u201909: Proceedings of the 27th international conference on human factors in computing systems","author":"T Moscovich","year":"2009","unstructured":"Moscovich T, Chevalier F, Henry N, Pietriga E, Fekete J (2009) Topology-aware navigation in large networks. In: CHI \u201909: Proceedings of the 27th international conference on human factors in computing systems. ACM, New York, pp 2319\u20132328"},{"key":"324-1_CR32","doi-asserted-by":"crossref","unstructured":"Ortmann M, Klimenta M, Brandes U (2016) A sparse stress model. In: Graph drawing and network visualization \u2013 24th international symposium, GD 2016, Athens, revised selected papers, pp 18\u201332","DOI":"10.1007\/978-3-319-50106-2_2"},{"key":"324-1_CR33","first-page":"248","volume-title":"Proceeding of the 5th international symposium graph drawing (GD\u201997)","author":"HC Purchase","year":"1997","unstructured":"Purchase HC (1997) Which aesthetic has the greatest effect on human understanding? In: Proceeding of the 5th international symposium graph drawing (GD\u201997). LNCS. Springer, pp 248\u2013261"},{"key":"324-1_CR34","unstructured":"Quigley A (2001) Large scale relational information visualization, clustering, and abstraction. PhD thesis, Department of Computer Science and Software Engineering, University of Newcastle"},{"key":"324-1_CR35","first-page":"155","volume-title":"Handbook of graph drawing and visualization chap 5","author":"A Rusu","year":"2013","unstructured":"Rusu A (2013) Tree drawing algorithms. In: Tamassia R (ed) Handbook of graph drawing and visualization chap 5. CRC Press, Boca Raton, pp 155\u2013192"},{"issue":"2","key":"324-1_CR36","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"SMC-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 Cybern SMC-11(2):109\u2013125","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"324-1_CR37","doi-asserted-by":"crossref","DOI":"10.1201\/b15385","volume-title":"Handbook of graph drawing and visualization","author":"R Tamassia","year":"2013","unstructured":"Tamassia R (2013) Handbook of graph drawing and visualization. Chapman & Hall\/CRC, Boca Raton"},{"key":"324-1_CR38","unstructured":"Tunkelang D (1999) A numerical optimization approach to general graph drawing. PhD thesis, Carnegie Mellon University"},{"key":"324-1_CR39","first-page":"193","volume-title":"Handbook of graph drawing and visualization chap 6","author":"L Vismara","year":"2013","unstructured":"Vismara L (2013) Planar straight-line drawing algorithms. In: Tamassia R (ed) Handbook of graph drawing and visualization chap 6. CRC Press, Boca Raton, pp 193\u2013222"},{"key":"324-1_CR40","doi-asserted-by":"publisher","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"},{"key":"324-1_CR41","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1145\/1124772.1124891","volume-title":"Proceedings of the SIGCHI conference on human factors in computing systems (CHI\u201906)","author":"M Wattenberg","year":"2006","unstructured":"Wattenberg M (2006) Visual exploration of multivariate graphs. In: Proceedings of the SIGCHI conference on human factors in computing systems (CHI\u201906). ACM, New York, pp 811\u2013819"}],"container-title":["Encyclopedia of Big Data Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-63962-8_324-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,29]],"date-time":"2020-10-29T05:46:45Z","timestamp":1603950405000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-63962-8_324-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319639628","9783319639628"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-63962-8_324-1","relation":{},"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"20 February 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}