{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T13:04:45Z","timestamp":1758891885422,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2020,3,2]],"date-time":"2020-03-02T00:00:00Z","timestamp":1583107200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,2]],"date-time":"2020-03-02T00:00:00Z","timestamp":1583107200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004733","name":"Universidade de Macau","doi-asserted-by":"publisher","award":["MYRG2019-00136-FST","MYRG2018-00246-FST"],"award-info":[{"award-number":["MYRG2019-00136-FST","MYRG2018-00246-FST"]}],"id":[{"id":"10.13039\/501100004733","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s11227-020-03226-w","type":"journal-article","created":{"date-parts":[[2020,3,2]],"date-time":"2020-03-02T21:03:52Z","timestamp":1583183032000},"page":"9654-9715","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Clustering-based force-directed algorithms for 3D graph visualization"],"prefix":"10.1007","volume":"76","author":[{"given":"Jiawei","family":"Lu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8468-6182","authenticated-orcid":false,"given":"Yain-Whar","family":"Si","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,3,2]]},"reference":[{"key":"3226_CR1","doi-asserted-by":"publisher","first-page":"2981","DOI":"10.1007\/978-1-4614-1800-9_184","volume-title":"Computational complexity: theory, techniques, and applications","author":"LC Freeman","year":"2012","unstructured":"Freeman LC (2012) Methods of social network visualization. In: Meyers RA (ed) Computational complexity: theory, techniques, and applications. Springer, New York, pp 2981\u20132998"},{"key":"3226_CR2","volume-title":"Graph drawing software","author":"M Junger","year":"2003","unstructured":"Junger M, Mutzel P (2003) Graph drawing software. Springer, Berlin"},{"issue":"6","key":"3226_CR3","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1109\/TCS.1979.1084652","volume":"26","author":"N Quinn","year":"1979","unstructured":"Quinn N, Breuer M (1979) A forced directed component placement procedure for printed circuit boards. IEEE Trans Circuits Syst 26(6):377\u2013388","journal-title":"IEEE Trans Circuits Syst"},{"key":"3226_CR4","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 Pract Exp 21:1129\u20131164","journal-title":"Softw Pract Exp"},{"key":"3226_CR5","first-page":"149","volume":"42","author":"P Eades","year":"1984","unstructured":"Eades P (1984) A heuristic for graph drawing. Congr Numerantium 42:149\u2013160","journal-title":"Congr Numerantium"},{"issue":"1","key":"3226_CR6","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 aalgorithm for drawing general undirected graphs. Inf Process Lett 31(1):7\u201315","journal-title":"Inf Process Lett"},{"issue":"3","key":"3226_CR7","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.socnet.2011.06.002","volume":"34","author":"U Brandes","year":"2012","unstructured":"Brandes U, Indlekofer N, Mader M (2012) Visualization methods for longitudinal social networks and stochastic actor-oriented modeling. Soc Netw 34(3):291\u2013308","journal-title":"Soc Netw"},{"key":"3226_CR8","first-page":"229","volume-title":"VENLO: interactive visual exploration of aligned biological networks and their evolution","author":"S Brasch","year":"2012","unstructured":"Brasch S, Fuellen G, Linsen L (2012) VENLO: interactive visual exploration of aligned biological networks and their evolution. Springer, Berlin, pp 229\u2013247"},{"key":"3226_CR9","doi-asserted-by":"crossref","unstructured":"Yang J, Leskovec J (2013) Overlapping community detection at scale: a nonnegative matrix factorization approach. In: Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, Rome, Italy, ACM, pp 587\u2013596","DOI":"10.1145\/2433396.2433471"},{"key":"3226_CR10","volume-title":"Graph clustering by flow simulation","author":"SMV Dongen","year":"2001","unstructured":"Dongen SMV (2001) Graph clustering by flow simulation. Utrecht University, Utrecht"},{"key":"3226_CR11","first-page":"388","volume-title":"A fast adaptive layout algorithm for undirected graphs (extended abstract and system demonstration)","author":"A Frick","year":"1995","unstructured":"Frick A, Ludwig A, Mehldau H (1995) A fast adaptive layout algorithm for undirected graphs (extended abstract and system demonstration). Springer, Berlin, pp 388\u2013403"},{"key":"3226_CR12","doi-asserted-by":"crossref","unstructured":"Bannister MJ, Eppstein D, Goodrich MT, Trott L (2013) Force-directed graph drawing using social gravity and scaling. In: Didimo W, Patrignani M (eds) Graph drawing: 20th international symposium, GD 2012, Redmond, WA, USA, September 19\u201321, 2012, Revised Selected Papers, Springer, Berlin, pp 414\u2013425","DOI":"10.1007\/978-3-642-36763-2_37"},{"key":"3226_CR13","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1145\/234535.234538","volume":"15","author":"R Davidson","year":"1996","unstructured":"Davidson R, Harel D (1996) Drawing graphs nicely using simulated annealing. ACM Trans Graph 15:301\u2013331","journal-title":"ACM Trans Graph"},{"issue":"6","key":"3226_CR14","doi-asserted-by":"publisher","first-page":"e98679","DOI":"10.1371\/journal.pone.0098679","volume":"9","author":"M Jacomy","year":"2014","unstructured":"Jacomy M, Venturini T, Heymann S, Bastian M (2014) ForceAtlas2, a continuous graph layout algorithm for handy network visualization designed for the Gephi software. Plos One 9(6):e98679. https:\/\/doi.org\/10.1371\/journal.pone.0098679","journal-title":"Plos One"},{"key":"3226_CR15","doi-asserted-by":"crossref","unstructured":"Noack A (2004) An energy model for visual graph clustering. In: Graph drawing: 11th international symposium, GD 2003 Perugia, Italy, September 21\u201324, 2003 Revised Papers, Liotta G (ed) Springer, Berlin, pp 425\u2013436","DOI":"10.1007\/978-3-540-24595-7_40"},{"key":"3226_CR16","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/3-540-44541-2_17","volume":"1984","author":"C Walshaw","year":"2000","unstructured":"Walshaw C (2000) A multilevel algorithm for force-directed graph drawing. Graph Drawing 1984:171\u2013182","journal-title":"Graph Drawing"},{"issue":"1","key":"3226_CR17","first-page":"37","volume":"10","author":"Y Hu","year":"2006","unstructured":"Hu Y (2006) Efficient, high-quality force-directed graph drawing. Math J 10(1):37\u201371","journal-title":"Math J"},{"issue":"1","key":"3226_CR18","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.jvlc.2011.12.001","volume":"23","author":"C-C Lin","year":"2012","unstructured":"Lin C-C, Yen H-C (2012) A new force-directed graph drawing method based on edge-edge repulsion. J Vis Lang Comput 23(1):29\u201342","journal-title":"J Vis Lang Comput"},{"issue":"4","key":"3226_CR19","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1109\/TPDS.2018.2869805","volume":"30","author":"A Arleo","year":"2019","unstructured":"Arleo A, Didimo W, Liotta G, Montecchiani F (2019) A distributed multilevel force-directed algorithm. IEEE Trans Parallel Distrib Syst 30(4):754\u2013765","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"1","key":"3226_CR20","first-page":"697","volume":"26","author":"A Suh","year":"2020","unstructured":"Suh A, Hajij M, Wang B, Scheidegger C, Rosen P (2020) Persistent homology guided force-directed graph layouts. IEEE Trans Vis Comput Graph 26(1):697\u2013707","journal-title":"IEEE Trans Vis Comput Graph"},{"key":"3226_CR21","unstructured":"Hong S-H, Torkel M, Wang Z, Chae D, Hong S, Langerenken D, Chafi H (2019) Multi-level graph drawing using Infomap clustering. In: 27th international symposium, GD 2019, Prague, Czech Republic, Springer, Berlin, pp 139\u2013146"},{"issue":"4","key":"3226_CR22","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1073\/pnas.0706851105","volume":"105","author":"M Rosvall","year":"2008","unstructured":"Rosvall M, Bergstrom CT (2008) Maps of random walks on complex networks reveal community structure. Proc Natl Acad Sci 105(4):23","journal-title":"Proc Natl Acad Sci"},{"key":"3226_CR23","first-page":"171","volume-title":"A multilevel algorithm for force-directed graph drawing","author":"C Walshaw","year":"2001","unstructured":"Walshaw C (2001) A multilevel algorithm for force-directed graph drawing. Springer, Berlin, pp 171\u2013182"},{"issue":"1","key":"3226_CR24","first-page":"676","volume":"26","author":"Y Wang","year":"2020","unstructured":"Wang Y, Jin Z, Wang Q, Cui W, Ma T, Qu H (2020) DeepDrawing: a deep learning approach to graph drawing. IEEE Trans Vis Comput Graph 26(1):676\u2013686","journal-title":"IEEE Trans Vis Comput Graph"},{"issue":"3","key":"3226_CR25","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1111\/cgf.13724","volume":"38","author":"R Gove","year":"2019","unstructured":"Gove R (2019) A random sampling O(n) force-calculation algorithm for graph layouts. Comput Graph Forum 38(3):739\u2013751","journal-title":"Comput Graph Forum"},{"issue":"6096","key":"3226_CR26","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1038\/324446a0","volume":"324","author":"J Barnes","year":"1986","unstructured":"Barnes J, Hut P (1986) A hierarchical O(N log N) force-calculation algorithm. Nature 324(6096):446\u2013449","journal-title":"Nature"},{"key":"3226_CR27","doi-asserted-by":"crossref","unstructured":"Eberly DH (2007) Chapter 14\u2014distance methods. In: 3D game engine design, 2nd edn, Morgan Kaufmann, San Francisco, pp 639\u2013679","DOI":"10.1016\/B978-0-12-229063-3.50018-2"},{"issue":"6","key":"3226_CR28","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"RW Floyd","year":"1962","unstructured":"Floyd RW (1962) Algorithm 97: shortest path. Commun ACM 5(6):345","journal-title":"Commun ACM"},{"key":"3226_CR29","unstructured":"Himsolt M (1997) GML: a portable graph file format. https:\/\/pdfs.semanticscholar.org\/d0a5\/6b07a59a29b48d6f957763add90e05925c2c.pdf?_ga=2.114878407.1985112014.1581063714-1167339558.1581063714"},{"key":"3226_CR30","unstructured":"KiNG Display Software. https:\/\/kinemage.biochem.duke.edu\/software\/king.php"},{"key":"3226_CR31","unstructured":"King AD (2004) Graph clustering with restricted neighbourhood search. Graduate Department of Computer Science, University of Toronto"},{"issue":"1","key":"3226_CR32","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. Inf Process Lett 31(1):7\u201315","journal-title":"Inf Process Lett"},{"issue":"2","key":"3226_CR33","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0022-247X(66)90115-6","volume":"15","author":"A Ben-Israel","year":"1966","unstructured":"Ben-Israel A (1966) A Newton\u2013Raphson method for the solution of systems of equations. J Math Anal Appl 15(2):243\u2013252","journal-title":"J Math Anal Appl"},{"key":"3226_CR34","unstructured":"Ph.D. Students in Computer Science, Pajek Dataset. https:\/\/vlado.fmf.uni-lj.si\/pub\/networks\/data\/esna\/CSPhD.htm"},{"key":"3226_CR35","unstructured":"Dolphins GML dataset. https:\/\/networkdata.ics.uci.edu\/data\/dolphins\/dolphins.gml"},{"key":"3226_CR36","unstructured":"Power grid dataset. https:\/\/www-personal.umich.edu\/~mejn\/netdata\/power.zip"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-020-03226-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-020-03226-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-020-03226-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,2]],"date-time":"2021-03-02T00:59:03Z","timestamp":1614646743000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-020-03226-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,2]]},"references-count":36,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["3226"],"URL":"https:\/\/doi.org\/10.1007\/s11227-020-03226-w","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2020,3,2]]},"assertion":[{"value":"2 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}