{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:24:41Z","timestamp":1759332281567,"version":"3.38.0"},"reference-count":61,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T00:00:00Z","timestamp":1606176000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"funder":[{"name":"\u201cAHeAD: efficient Algorithms for HArnessing networked Data\u201d by MIUR, the Italian Ministry of Education, University and Research","award":["20174LF3T8"],"award-info":[{"award-number":["20174LF3T8"]}]}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Information Visualization"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p> One of the primary goals of many systems for the visual analysis of dynamically changing networks is to maintain the stability of the drawing throughout the sequence of graph changes. We investigate the scenario where the changes are determined by a stream of events, each being either an edge addition or an edge removal. The visualization must be updated immediately after each new event is received. Our main goal is to provide the user with an intuitive visualization that highlights the different connected components of the graph while preserving the user\u2019s mental map after each event. The drawing stability is measured in terms of changes in the orthogonal relationships between vertices of two consecutive drawings. We describe two different visualization models, one for the 1-dimensional space and the other for the 2-dimensional space. In both models the connected components are drawn inside rectangular regions. To validate our approach, we report the results of an experimental analysis that compares the drawing stability of the online algorithm with that of an offline algorithm that knows in advance the whole sequence of events. We also present a case study of our online algorithm on a collaboration network. <\/jats:p>","DOI":"10.1177\/1473871620972339","type":"journal-article","created":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T08:53:17Z","timestamp":1606207997000},"page":"3-19","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":1,"title":["Stable visualization of connected components in dynamic graphs"],"prefix":"10.1177","volume":"20","author":[{"given":"Emilio Di","family":"Giacomo","sequence":"first","affiliation":[{"name":"University of Perugia, Perugia, Umbria, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4379-6059","authenticated-orcid":false,"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[{"name":"University of Perugia, Perugia, Umbria, Italy"}]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[{"name":"University of T\u00fcbingen, Tubingen, Germany"}]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[{"name":"University of Perugia, Perugia, Umbria, Italy"}]}],"member":"179","published-online":{"date-parts":[[2020,11,24]]},"reference":[{"key":"bibr1-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1515\/9781400841356"},{"key":"bibr2-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12791"},{"key":"bibr3-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1006\/jvlc.1995.1010"},{"key":"bibr4-1473871620972339","first-page":"184","volume-title":"Graph drawing, volume 4372 of lecture notes in computer science","author":"Purchase HC","year":"1996"},{"key":"bibr5-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2010.78"},{"key":"bibr6-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1109\/PacificVis.2012.6183578"},{"key":"bibr7-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijhcs.2013.08.004"},{"key":"bibr8-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-50106-2_43"},{"key":"bibr9-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1515\/icom-2015-0038"},{"key":"bibr10-1473871620972339","first-page":"110","author":"Wattenberg M.","year":"2002","journal-title":"INFOVIS"},{"key":"bibr11-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054118410010"},{"key":"bibr12-1473871620972339","first-page":"223","volume-title":"Handbook of graph drawing and visualization","author":"Duncan CA","year":"2013"},{"key":"bibr13-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1109\/INFVIS.2004.18"},{"key":"bibr14-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.ivs.9500037"},{"key":"bibr15-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2011.226"},{"key":"bibr16-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2009.01451.x"},{"key":"bibr17-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2014.2383380"},{"key":"bibr18-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2013.263"},{"key":"bibr19-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2018.2865265"},{"key":"bibr20-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2008.11"},{"key":"bibr21-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2011.142"},{"key":"bibr22-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-6215-6_19"},{"key":"bibr23-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2011.128"},{"key":"bibr24-1473871620972339","first-page":"228","volume-title":"Graph drawing, volume 3383 of lecture notes in computer science","author":"G\u00f6rg C","year":"2004"},{"key":"bibr25-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.ivs.9500078"},{"key":"bibr26-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2015.2507595"},{"key":"bibr27-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12872"},{"key":"bibr28-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0255(02)00183-4"},{"key":"bibr29-1473871620972339","first-page":"378","volume-title":"Graph drawing, volume 2265 of lecture notes in computer science","author":"Freivalds K","year":"2001"},{"key":"bibr30-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1109\/APVIS.2007.329283"},{"key":"bibr31-1473871620972339","first-page":"155","author":"von Landesberger T","year":"2009","journal-title":"IEEE VAST"},{"key":"bibr32-1473871620972339","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00302"},{"key":"bibr33-1473871620972339","first-page":"206","volume-title":"Graph drawing, volume 5417 of lecture notes in computer science","author":"Gansner ER","year":"2008"},{"key":"bibr34-1473871620972339","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00025"},{"key":"bibr35-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1049\/piee.1968.0004"},{"key":"bibr36-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.52.3.688"},{"key":"bibr37-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1109\/12.46286"},{"key":"bibr38-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(79)90021-2"},{"key":"bibr39-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2017.07.009"},{"key":"bibr40-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00314-6"},{"key":"bibr41-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1109\/72.485670"},{"key":"bibr42-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2005.06.088"},{"key":"bibr43-1473871620972339","first-page":"224","volume-title":"Graph drawing, volume 10692 of lecture notes in computer science","author":"Klawitter J","year":"2017"},{"key":"bibr44-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1109\/MCG.2007.121"},{"key":"bibr45-1473871620972339","first-page":"386","volume-title":"Graph drawing, volume 4372 of lecture notes in computer science","author":"Gansner ER","year":"2006"},{"key":"bibr46-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1101\/gr.092759.109"},{"key":"bibr47-1473871620972339","first-page":"285","volume-title":"Handbook of graph drawing and visualization","author":"Six JM","year":"2013"},{"key":"bibr48-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2018.04.067"},{"key":"bibr49-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-50106-2_29"},{"key":"bibr50-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-27261-0_16"},{"volume-title":"Graph drawing: algorithms for the visualization of graphs","year":"1999","author":"Di Battista G","key":"bibr51-1473871620972339"},{"volume-title":"Drawing graphs, methods and models (The book grow out of a Dagstuhl Seminar, April 1999), volume 2025 of lecture notes in computer science","year":"2001","author":"Kaufmann M","key":"bibr52-1473871620972339"},{"key":"bibr53-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2015.2467451"},{"key":"bibr54-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2010.265"},{"key":"bibr55-1473871620972339","first-page":"60","volume-title":"Graph drawing, volume 2265 of lecture notes in computer science","author":"Di Battista G","year":"2001"},{"key":"bibr56-1473871620972339","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00200"},{"key":"bibr57-1473871620972339","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00016"},{"key":"bibr58-1473871620972339","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00402"},{"key":"bibr59-1473871620972339","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00444"},{"key":"bibr60-1473871620972339","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-35802-0_5"},{"key":"bibr61-1473871620972339","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00443"}],"container-title":["Information Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1473871620972339","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/1473871620972339","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1473871620972339","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T09:33:37Z","timestamp":1740821617000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/1473871620972339"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,24]]},"references-count":61,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1177\/1473871620972339"],"URL":"https:\/\/doi.org\/10.1177\/1473871620972339","relation":{},"ISSN":["1473-8716","1473-8724"],"issn-type":[{"type":"print","value":"1473-8716"},{"type":"electronic","value":"1473-8724"}],"subject":[],"published":{"date-parts":[[2020,11,24]]}}}