{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T14:26:53Z","timestamp":1771079213366,"version":"3.50.1"},"reference-count":60,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100003407","name":"MIUR through \u201cAHeAD: efficient Algorithms for HArnessing networked Data\u201d","doi-asserted-by":"publisher","award":["20174LF3T8"],"award-info":[{"award-number":["20174LF3T8"]}],"id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"publisher"}]},{"name":"University of Perugia, Fondi di Ricerca di Ateneo 2021, Project \u201cAIDMIX\u2014Artificial Intelligence for Decision Making: Methods for Interpretability and eXplainability"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/access.2022.3218884","type":"journal-article","created":{"date-parts":[[2022,11,4]],"date-time":"2022-11-04T01:36:13Z","timestamp":1667525773000},"page":"115776-115786","source":"Crossref","is-referenced-by-count":4,"title":["BrowVis: Visualizing Large Graphs in the Browser"],"prefix":"10.1109","volume":"10","author":[{"given":"Luca","family":"Consalvi","sequence":"first","affiliation":[{"name":"Dipartimento di Ingegneria, Università degli Studi di Perugia, Perugia, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4379-6059","authenticated-orcid":false,"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[{"name":"Dipartimento di Ingegneria, Università degli Studi di Perugia, Perugia, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2886-9694","authenticated-orcid":false,"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[{"name":"Dipartimento di Ingegneria, Università degli Studi di Perugia, Perugia, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0543-8912","authenticated-orcid":false,"given":"Fabrizio","family":"Montecchiani","sequence":"additional","affiliation":[{"name":"Dipartimento di Ingegneria, Università degli Studi di Perugia, Perugia, Italy"}]}],"member":"263","reference":[{"key":"ref39","first-page":"25","article-title":"A scalable parallel force-directed graph layout algorithm","author":"tikhonova","year":"2008","journal-title":"Proc EGPGV"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2425333.2425376"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00219-9_10"},{"key":"ref32","first-page":"169","article-title":"Improved efficiency of spring embedders: Taking advantage of GPU programming","author":"auber","year":"2007","journal-title":"VIIP"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-18469-7_8"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31843-9_29"},{"key":"ref37","first-page":"83","article-title":"Distributed force-directed graph layout and visualization","author":"mueller","year":"2006","journal-title":"Proc EGPGV"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2017.2689016"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ISPDC.2012.32"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2008.85"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcom.2022.100512"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00070"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00389-9"},{"key":"ref29","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-31843-9_29","article-title":"A potential field based multilevel algorithm for drawing large graphs","author":"hachul","year":"2005"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.07.097"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2021.10.009"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00150"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.12.069"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2011.01898.x"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2008.11.017"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2013.09.048"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44541-2_19"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380211102"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.21105\/joss.00814"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.13178"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2021.108177"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45735-6_1"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2016.2555319"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"ref55","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs I","volume":"6","author":"erdos","year":"1959","journal-title":"Publ Math (Debrecen)"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1010205"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.3390\/app12157541"},{"key":"ref10","article-title":"Force-directed drawing algorithms","author":"kobourov","year":"2013","journal-title":"Handbook of Graph Drawing and Visualization"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.11.012"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/iV.2015.56"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2018.2869805"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2012.238"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3058736"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2808194.2809478"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-3016"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-19-0901-6_5"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.visinf.2021.01.002"},{"key":"ref19","first-page":"543","article-title":"The open graph drawing framework (OGDF)","author":"chimani","year":"2013","journal-title":"Handbook of Graph Drawing and Visualization"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2021.09.017"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2021.08.018"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/HORA55278.2022.9799819"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s40558-018-0125-8"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1177\/1473871618821740"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00548-x"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2011.185"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1002\/wics.1343"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/INFVIS.2004.43"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/INFVIS.2003.1249011"},{"key":"ref48","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1093\/bioinformatics\/btv557","article-title":"Cytoscape.Js: A graph theory library for visualisation and analysis","volume":"32","author":"franz","year":"2016","journal-title":"Bioinformatics"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2018.2869165"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/PacificVis52677.2021.00027"},{"key":"ref41","first-page":"189","article-title":"MuGDAD: Multilevel graph drawing algorithm in a distributed architecture","author":"hinge","year":"2017","journal-title":"Proc Conf Comput Graph Vis Comput Vis"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2006.120"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/VL.1996.545307"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9668973\/09934843.pdf?arnumber=9934843","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,11]],"date-time":"2023-03-11T03:05:39Z","timestamp":1678503939000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9934843\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":60,"URL":"https:\/\/doi.org\/10.1109\/access.2022.3218884","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}