{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,17]],"date-time":"2026-09-17T11:59:46Z","timestamp":1789646386003,"version":"4.0.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319272603","type":"print"},{"value":"9783319272610","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","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":[[2015]]},"DOI":"10.1007\/978-3-319-27261-0_41","type":"book-chapter","created":{"date-parts":[[2015,11,26]],"date-time":"2015-11-26T06:24:59Z","timestamp":1448519099000},"page":"502-514","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["Shape-Based Quality Metrics for Large Graph Visualization"],"prefix":"10.1007","author":[{"given":"Peter","family":"Eades","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Seok-Hee","family":"Hong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Karsten","family":"Klein","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"An","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,11,27]]},"reference":[{"key":"41_CR1","series-title":"Lecture Notes in Computer Science","first-page":"523","volume-title":"Graph Drawing","author":"M Chimani","year":"2014","unstructured":"Chimani, M., et al.: Graph drawings with less stress and fewer crossings are preferable. In: Duncan, C., Symvonis, A. (eds.) GD2014. LNCS, vol. 8871, pp. 523\u2013524. Springer, Heidelberg (2014)"},{"issue":"1","key":"41_CR2","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/BF02086608","volume":"16","author":"P Eades","year":"1996","unstructured":"Eades, P., Whitesides, S.: The realization problem for euclidean minimum spanning trees in NP-hard. Algorithmica 16(1), 60\u201382 (1996)","journal-title":"Algorithmica"},{"issue":"4","key":"41_CR3","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1109\/TIT.1983.1056714","volume":"29","author":"H Edelsbrunner","year":"1983","unstructured":"Edelsbrunner, H., Kirkpatrick, D.G., Seidel, R.: On the shape of a set of points in the plane. IEEE Trans. Inf. Theory 29(4), 551\u2013558 (1983)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"41_CR4","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"TMJ Fruchterman","year":"1991","unstructured":"Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force-directed placement. Softw. Pract. Exp. 21(11), 1129\u20131164 (1991)","journal-title":"Softw. Pract. Exp."},{"key":"41_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-319-03841-4_24","volume-title":"Graph Drawing","author":"ER Gansner","year":"2013","unstructured":"Gansner, E.R., Hu, Y., Krishnan, S.: COAST: a convex optimization approach to stress-based embedding. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 268\u2013279. Springer, Heidelberg (2013)"},{"issue":"6","key":"41_CR6","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1109\/TVCG.2012.299","volume":"19","author":"ER Gansner","year":"2013","unstructured":"Gansner, E.R., Yifan, H., North, S.C.: A maxent-stress model for graph layout. IEEE Trans. Vis. Comput. Graph. 19(6), 927\u2013940 (2013)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"1","key":"41_CR7","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10044-008-0141-y","volume":"13","author":"X Gao","year":"2010","unstructured":"Gao, X., Xiao, B., Tao, D., Li, X.: A survey of graph edit distance. Pattern Anal. Appl. 13(1), 113\u2013129 (2010)","journal-title":"Pattern Anal. Appl."},{"key":"41_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-540-31843-9_29","volume-title":"Graph Drawing","author":"S Hachul","year":"2005","unstructured":"Hachul, S., J\u00fcnger, M.: Drawing large graphs with a potential-field-based multilevel algorithm. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 285\u2013295. Springer, Heidelberg (2005)"},{"key":"41_CR9","unstructured":"Hinton, G.E., Roweis, S.T.: Stochastic neighbor embedding. In: NIPS 2002, pp. 833\u2013840 (2002)"},{"key":"41_CR10","doi-asserted-by":"crossref","unstructured":"Hu, Y., Koren, Y.: Extending the spring-electrical model to overcome warping effects. In: Eades, P., Ertl, T., Shen, H.-W. (eds.) PacificVis2009, pp. 129\u2013136. IEEE (2009)","DOI":"10.1109\/PACIFICVIS.2009.4906847"},{"key":"41_CR11","doi-asserted-by":"crossref","unstructured":"Huang, W., Hong, S.-H., Eades, P.: Effects of crossing angles. In: Fujishiro, I., Li, H., Ma, K. L. (eds.) IEEE PacificVis2008, pp. 41\u201346 (2008)","DOI":"10.1109\/PACIFICVIS.2008.4475457"},{"key":"41_CR12","doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: Simrank: a measure of structural-context similarity. In: KDD2002, pp. 538\u2013543. ACM (2002)","DOI":"10.1145\/775047.775126"},{"key":"41_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1007\/978-3-662-45803-7_20","volume-title":"Graph Drawing","author":"SG Kobourov","year":"2014","unstructured":"Kobourov, S.G., Pupyrev, S., Saket, B.: Are crossings important for drawing large graphs? In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 234\u2013245. Springer, Heidelberg (2014)"},{"key":"41_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/978-3-662-45803-7_10","volume-title":"Graph Drawing","author":"MR Marner","year":"2014","unstructured":"Marner, M.R., Smith, R.T., Thomas, B.H., Klein, K., Eades, P., Hong, S.-H.: GION: interactively untangling large graphs on wall-sized displays. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 113\u2013124. Springer, Heidelberg (2014)"},{"key":"41_CR15","doi-asserted-by":"crossref","unstructured":"Nguyen, Q.H., Eades, P., Hong, S.-H.: On the faithfulness of graph visualizations. In: Carpendale, S., Chen, W., Hong, S. (eds.) PacificVis2013, pp. 209\u2013216. IEEE (2013)","DOI":"10.1109\/PacificVis.2013.6596147"},{"key":"41_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry - An Introduction","author":"F Preparata","year":"1985","unstructured":"Preparata, F., Shamos, M.: Computational Geometry - An Introduction. Springer, New York (1985)"},{"key":"41_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/3-540-63938-1_67","volume-title":"Graph Drawing","author":"HC Purchase","year":"1997","unstructured":"Purchase, H.C.: Which aesthetic has the greatest effect on human understanding? In: Di Battista, G. (ed.) GD 1997. LNCS, vol. 1353, pp. 248\u2013261. Springer, Heidelberg (1997)"},{"issue":"3","key":"41_CR18","doi-asserted-by":"publisher","first-page":"255","DOI":"10.7155\/jgaa.00054","volume":"6","author":"HC Purchase","year":"2002","unstructured":"Purchase, H.C., Allder, J.-A., Carrington, D.A.: Graph layout aesthetics in uml diagrams: user preferences. J. Graph Algorithms Appl. 6(3), 255\u2013279 (2002)","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"41_CR19","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1023\/A:1016344215610","volume":"7","author":"HC Purchase","year":"2002","unstructured":"Purchase, H.C., Carrington, D.A., Allder, J.-A.: Empirical evaluation of aesthetics-based graph layout. Empirical Softw. Eng. 7(3), 233\u2013255 (2002)","journal-title":"Empirical Softw. Eng."},{"key":"41_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/BFb0021827","volume-title":"Graph Drawing","author":"HC Purchase","year":"1996","unstructured":"Purchase, H.C., Cohen, R.F., James, M.I.: Validating graph drawing aesthetics. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol. 1027, pp. 435\u2013446. Springer, Heidelberg (1996)"},{"issue":"2","key":"41_CR21","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"11","author":"K Sugiyama","year":"1981","unstructured":"Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Trans. Syst. Man. Cybern. 11(2), 109\u2013125 (1981)","journal-title":"IEEE Trans. Syst. Man. Cybern."},{"key":"41_CR22","unstructured":"Tamassia, R., Batini, C., Di Battista, G.: Automatic graph drawing and readability of diagrams. Technical Report, Universita di Roma La Sapienza, Dipartimento do Informatica e Sistemistica, 01.87 (1987)"},{"key":"41_CR23","unstructured":"Tamassia, R., Batini, C., Talamo, M.: An algorithm for automatic layout of entity-relationship diagrams. In: Davis, C.G., Jajodia, S., Ng, P.A., Yeh, R.T. (eds.) ER83, pp. 421\u2013439. North-Holland (1983)"},{"key":"41_CR24","volume-title":"Computational Morphology","author":"G Toussaint","year":"1988","unstructured":"Toussaint, G.: Computational Morphology. North Holland, Amsterdam (1988)"},{"issue":"2","key":"41_CR25","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1057\/palgrave.ivs.9500013","volume":"1","author":"C Ware","year":"2002","unstructured":"Ware, C., Purchase, H.C., Colpoys, L., McGill, M.: Cognitive measurements of graph aesthetics. Inf. Vis. 1(2), 103\u2013110 (2002)","journal-title":"Inf. Vis."},{"key":"41_CR26","unstructured":"Wilkinson, L., Anand, A., Grossman, R.L.: Graph-theoretic scagnostics. In: Stasko, J., Ward, M.O. (eds.) InfoVis2005, p. 21. IEEE (2005)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27261-0_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T15:13:12Z","timestamp":1748704392000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27261-0_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319272603","9783319272610"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27261-0_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"27 November 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}