{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T16:05:00Z","timestamp":1781798700142,"version":"3.54.5"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030687656","type":"print"},{"value":"9783030687663","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-68766-3_35","type":"book-chapter","created":{"date-parts":[[2021,2,14]],"date-time":"2021-02-14T09:11:53Z","timestamp":1613293913000},"page":"450-465","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["New Quality Metrics for Dynamic Graph Drawing"],"prefix":"10.1007","author":[{"given":"Amyra","family":"Meidiana","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Seok-Hee","family":"Hong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Eades","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,2,14]]},"reference":[{"issue":"11","key":"35_CR1","doi-asserted-by":"publisher","first-page":"1044","DOI":"10.1016\/j.ijhcs.2013.08.004","volume":"71","author":"D Archambault","year":"2013","unstructured":"Archambault, D., Purchase, H.C.: The \u201cmap\u201d in the mental map: experimental results in dynamic graph drawing. Int. J. Hum Comput Stud. 71(11), 1044\u20131055 (2013)","journal-title":"Int. J. Hum Comput Stud."},{"key":"35_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, H.C.: Can animation support the visualisation of dynamic graphs? Inf. Sci. 330, 495\u2013509 (2016)","journal-title":"Inf. Sci."},{"key":"35_CR3","unstructured":"Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall PTR, Upper Saddle River (1998)"},{"key":"35_CR4","doi-asserted-by":"publisher","unstructured":"Baur, M., et al.: Visone software for visual social network analysis. In: International Symposium on Graph Drawing, pp. 463\u2013464. Springer (2001). https:\/\/doi.org\/10.1007\/3-540-45848-4_47","DOI":"10.1007\/3-540-45848-4_47"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Beck, F., Burch, M., Diehl, S., Weiskopf, D.: A taxonomy and survey of dynamic graph visualization. In: Computer Graphics Forum, vol. 36, pp. 133\u2013159. Wiley Online Library, Hoboken (2017)","DOI":"10.1111\/cgf.12791"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"B\u00f6hringer, K.F., Paulisch, F.N.: Using constraints to achieve stability in automatic graph layout algorithms. In: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, pp. 43\u201351 (1990)","DOI":"10.1145\/97243.97250"},{"key":"35_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-540-70904-6_6","volume-title":"Graph Drawing","author":"U Brandes","year":"2007","unstructured":"Brandes, U., Pich, C.: Eigensolver methods for progressive multidimensional scaling of large data. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 42\u201353. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70904-6_6"},{"key":"35_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/3-540-44969-8_9","volume-title":"Drawing Graphs","author":"J Branke","year":"2001","unstructured":"Branke, J.: Dynamic graph drawing. In: Kaufmann, M., Wagner, D. (eds.) Drawing Graphs. LNCS, vol. 2025, pp. 228\u2013246. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44969-8_9"},{"key":"35_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/3-540-45848-4_34","volume-title":"Graph Drawing","author":"A David","year":"2002","unstructured":"David, A.: Tulip. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 435\u2013437. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45848-4_34"},{"key":"35_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/3-540-36151-0_3","volume-title":"Graph Drawing","author":"S Diehl","year":"2002","unstructured":"Diehl, S., G\u00f6rg, C.: Graphs, they are changing. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol. 2528, pp. 23\u201331. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36151-0_3"},{"issue":"1","key":"35_CR11","doi-asserted-by":"publisher","first-page":"29","DOI":"10.7155\/jgaa.00405","volume":"21","author":"P Eades","year":"2017","unstructured":"Eades, P., Hong, S.H., Nguyen, A., Klein, K.: Shape-based quality metrics for large graph visualization. J. Graph Algorithms Appl. 21(1), 29\u201353 (2017)","journal-title":"J. Graph Algorithms Appl."},{"key":"35_CR12","unstructured":"Eades, P., Lai, W., Misue, K., Sugiyama, K.: Preserving the mental map of a diagram. Technical report, Technical Report IIAS-RR-91-16E, Fujitsu Laboratories (1991)"},{"key":"35_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/3-540-45848-4_57","volume-title":"Graph Drawing","author":"J Ellson","year":"2002","unstructured":"Ellson, J., Gansner, E., Koutsofios, L., North, S.C., Woodhull, G.: Graphviz\u2014 open source graph drawing tools. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 483\u2013484. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45848-4_57"},{"issue":"383","key":"35_CR14","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1080\/01621459.1983.10478008","volume":"78","author":"EB Fowlkes","year":"1983","unstructured":"Fowlkes, E.B., Mallows, C.L.: A method for comparing two hierarchical clusterings. J. Am. Stat. Assoc. 78(383), 553\u2013569 (1983). https:\/\/doi.org\/10.1080\/01621459.1983.10478008","journal-title":"J. Am. Stat. Assoc."},{"key":"35_CR15","doi-asserted-by":"publisher","unstructured":"Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force-directed placement. Softw. Pract. Experience 21(11), 1129\u20131164 (1991). https:\/\/doi.org\/10.1002\/spe.4380211102","DOI":"10.1002\/spe.4380211102"},{"issue":"6","key":"35_CR16","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1109\/TVCG.2012.299","volume":"19","author":"ER Gansner","year":"2012","unstructured":"Gansner, E.R., Hu, Y., North, S.: A maxent-stress model for graph layout. IEEE Trans. Visual Comput. Graph. 19(6), 927\u2013940 (2012)","journal-title":"IEEE Trans. Visual Comput. Graph."},{"key":"35_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-540-31843-9_25","volume-title":"Graph Drawing","author":"ER Gansner","year":"2005","unstructured":"Gansner, E.R., Koren, Y., North, S.: Graph drawing by stress majorization. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 239\u2013250. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31843-9_25"},{"issue":"1","key":"35_CR18","first-page":"37","volume":"10","author":"Y Hu","year":"2005","unstructured":"Hu, Y.: Efficient, high-quality force-directed graph drawing. Math. J. 10(1), 37\u201371 (2005)","journal-title":"Math. J."},{"key":"35_CR19","doi-asserted-by":"crossref","unstructured":"Huang, W., Hong, S.H., Eades, P.: Effects of crossing angles. In: 2008 IEEE Pacific Visualization Symposium, pp. 41\u201346. IEEE (2008)","DOI":"10.1109\/PACIFICVIS.2008.4475457"},{"issue":"1","key":"35_CR20","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L Hubert","year":"1985","unstructured":"Hubert, L., Arabie, P.: Comparing partitions. J. Classif. 2(1), 193\u2013218 (1985). https:\/\/doi.org\/10.1007\/BF01908075","journal-title":"J. Classif."},{"key":"35_CR21","unstructured":"Kruiger, J.F.: tsNET (2017). https:\/\/github.com\/HanKruiger\/tsNET\/"},{"issue":"3","key":"35_CR22","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1111\/cgf.13187","volume":"36","author":"JF Kruiger","year":"2017","unstructured":"Kruiger, J.F., Rauber, P.E., Martins, R.M., Kerren, A., Kobourov, S., Telea, A.C.: Graph layouts by t-SNE. Comput. Graph. Forum 36(3), 283\u2013294 (2017). https:\/\/doi.org\/10.1111\/cgf.13187","journal-title":"Comput. Graph. Forum"},{"key":"35_CR23","first-page":"2579","volume":"9","author":"LVD Maaten","year":"2008","unstructured":"Maaten, L.V.D., Hinton, G.: Visualizing data using t-SNE. J. Mach. Learn. Res. 9, 2579\u20132605 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"35_CR24","unstructured":"MacQueen, J., et al.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the fifth Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, pp. 281\u2013297. University of California Press (1967)"},{"issue":"4","key":"35_CR25","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1109\/MPRV.2011.79","volume":"11","author":"A Madan","year":"2011","unstructured":"Madan, A., Cebrian, M., Moturu, S., Farrahi, K., et al.: Sensing the \u201chealth state\u201d of a community. IEEE Pervasive Comput. 11(4), 36\u201345 (2011)","journal-title":"IEEE Pervasive Comput."},{"key":"35_CR26","doi-asserted-by":"crossref","unstructured":"Meidiana, A., Hong, S.H., Eades, P., Keim, D.: A quality metric for symmetric graph drawings. arXiv preprint arXiv:1910.04974 (2019)","DOI":"10.1109\/PacificVis48177.2020.1022"},{"key":"35_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-030-35802-0_10","volume-title":"Graph Drawing and Network Visualization","author":"A Meidiana","year":"2019","unstructured":"Meidiana, A., Hong, S.-H., Eades, P., Keim, D.: A quality metric for visualization of clusters in graphs. In: Archambault, D., T\u00f3th, C.D. (eds.) GD 2019. LNCS, vol. 11904, pp. 125\u2013138. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35802-0_10"},{"key":"35_CR28","doi-asserted-by":"crossref","unstructured":"Meidiana, A., Hong, S.H., Eades, P., Keim, D.: Quality metrics for symmetric graph drawings. In: 2020 IEEE Pacific Visualization Symposium (PacificVis), pp. 11\u201315. IEEE (2020)","DOI":"10.1109\/PacificVis48177.2020.1022"},{"key":"35_CR29","doi-asserted-by":"crossref","unstructured":"Nguyen, Q., Eades, P., Hong, S.H.: On the faithfulness of graph visualizations. In: 2013 IEEE Pacific Visualization Symposium (PacificVis), pp. 209\u2013216. IEEE (2013)","DOI":"10.1109\/PacificVis.2013.6596147"},{"key":"35_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-540-24595-7_40","volume-title":"Graph Drawing","author":"A Noack","year":"2004","unstructured":"Noack, A.: An energy model for visual graph clustering. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 425\u2013436. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24595-7_40"},{"issue":"2","key":"35_CR31","doi-asserted-by":"publisher","first-page":"595","DOI":"10.7155\/jgaa.00370","volume":"19","author":"A Nocaj","year":"2015","unstructured":"Nocaj, A., Ortmann, M., Brandes, U.: Untangling the hairballs of multi-centered, small-world online social media networks. J. Graph Algorithms Appl. 19(2), 595\u2013618 (2015). https:\/\/doi.org\/10.7155\/jgaa.00370","journal-title":"J. Graph Algorithms Appl."},{"key":"35_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-319-50106-2_2","volume-title":"Graph Drawing and Network Visualization","author":"M Ortmann","year":"2016","unstructured":"Ortmann, M., Klimenta, M., Brandes, U.: A sparse stress model. In: Hu, Y., N\u00f6llenburg, M. (eds.) GD 2016. LNCS, vol. 9801, pp. 18\u201332. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50106-2_2"},{"key":"35_CR33","unstructured":"Pedregosa, F., et al.: Scikit-learn: Machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)"},{"key":"35_CR34","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":"H Purchase","year":"1997","unstructured":"Purchase, H.: Which aesthetic has the greatest effect on human understanding? In: DiBattista, G. (ed.) GD 1997. LNCS, vol. 1353, pp. 248\u2013261. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63938-1_67"},{"key":"35_CR35","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.: Validating graph drawing aesthetics. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol. 1027, pp. 435\u2013446. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0021827"},{"issue":"336","key":"35_CR36","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1080\/01621459.1971.10482356","volume":"66","author":"WM Rand","year":"1971","unstructured":"Rand, W.M.: Objective criteria for the evaluation of clustering methods. J. Am. Stat. Assoc. 66(336), 846\u2013850 (1971). https:\/\/doi.org\/10.1080\/01621459.1971.10482356","journal-title":"J. Am. Stat. Assoc."},{"issue":"1","key":"35_CR37","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/21.87055","volume":"18","author":"R Tamassia","year":"1988","unstructured":"Tamassia, R., Di Battista, G., Batini, C.: Automatic graph drawing and readability of diagrams. IEEE Trans. Syst. Man Cybern. 18(1), 61\u201379 (1988). https:\/\/doi.org\/10.1109\/21.87055","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"35_CR38","doi-asserted-by":"publisher","unstructured":"Torgerson, W.S.: Multidimensional scaling: I. theory and method. Psychometrika 17(4), 401\u2013419 (1952). https:\/\/doi.org\/10.1007\/BF02288916","DOI":"10.1007\/BF02288916"},{"key":"35_CR39","volume-title":"Envisioning information","author":"ER Tufte","year":"1990","unstructured":"Tufte, E.R., Goeler, N.H., Benson, R.: Envisioning information, vol. 126. Graphics press Cheshire, CT (1990)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-68766-3_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T23:04:04Z","timestamp":1739401444000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-68766-3_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030687656","9783030687663"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-68766-3_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vancouver, BC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gd2020.cs.ubc.ca\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"82","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,02","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}