{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T19:45:52Z","timestamp":1774554352218,"version":"3.50.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T00:00:00Z","timestamp":1717113600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T00:00:00Z","timestamp":1717113600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61872432"],"award-info":[{"award-number":["61872432"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Vis"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s12650-024-00991-1","type":"journal-article","created":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T06:01:53Z","timestamp":1717135313000},"page":"925-940","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["DeepFD: a deep learning approach to fast generate force-directed layout for large graphs"],"prefix":"10.1007","volume":"27","author":[{"given":"Shuhang","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Ruihong","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Qing","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Yining","family":"Quan","sequence":"additional","affiliation":[]},{"given":"Qi","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,31]]},"reference":[{"issue":"4","key":"991_CR1","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. https:\/\/doi.org\/10.1109\/TPDS.2018.2869805","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"6096","key":"991_CR2","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"},{"issue":"6","key":"991_CR3","doi-asserted-by":"publisher","first-page":"1373","DOI":"10.1162\/089976603321780317","volume":"15","author":"M Belkin","year":"2003","unstructured":"Belkin M, Niyogi P (2003) Laplacian eigenmaps for dimensionality reduction and data representation. Neural Comput 15(6):1373\u20131396. https:\/\/doi.org\/10.1162\/089976603321780317","journal-title":"Neural Comput"},{"key":"991_CR4","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 (2007) Eigensolver methods for progressive multidimensional scaling of large data. In: Kaufmann M, Wagner D (eds) Graph drawing. Springer, Berlin, pp 42\u201353"},{"issue":"3","key":"991_CR5","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1145\/264645.264657","volume":"4","author":"JD Cohen","year":"1997","unstructured":"Cohen JD (1997) Drawing graphs to convey proximity: an incremental arrangement method. ACM Trans Comput Hum Interact 4(3):197\u2013229. https:\/\/doi.org\/10.1145\/264645.264657","journal-title":"ACM Trans Comput Hum Interact"},{"key":"991_CR6","doi-asserted-by":"publisher","unstructured":"Dunne C, Shneiderman B (2013) Motif simplification: Improving network visualization readability with fan, connector, and clique glyphs. In: Proceedings of the SIGCHI conference on human factors in computing systems, CHI \u201913. Association for Computing Machinery, New York, pp 3247\u20133256. https:\/\/doi.org\/10.1145\/2470654.2466444","DOI":"10.1145\/2470654.2466444"},{"key":"991_CR7","unstructured":"Eades P (1984) A heuristic for graph drawing. In: Proceedings of the 13th Manitoba conference on numerical mathematics and computing, vol. 24. Utilitas Mathematica, University of Manitoba, Winnipeg"},{"key":"991_CR8","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/j.procs.2015.11.078","volume":"66","author":"D Egorov","year":"2015","unstructured":"Egorov D, Bezgodov A (2015) Improved force-directed method of graph layout generation with adaptive step length. Procedia Comput Sci 66:689\u2013696","journal-title":"Procedia Comput Sci"},{"issue":"11","key":"991_CR9","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(11):1129\u20131164. https:\/\/doi.org\/10.1002\/spe.4380211102","journal-title":"Softw Pract Exp"},{"key":"991_CR10","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 ER, Koren Y, North S (2005) Graph drawing by stress majorization. In: Pach J (ed) Graph drawing. Springer, Berlin, pp 239\u2013250"},{"issue":"3\u20134","key":"991_CR11","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1177\/1473871612455749","volume":"12","author":"H Gibson","year":"2013","unstructured":"Gibson H, Faith J, Vickers P (2013) A survey of two-dimensional graph layout techniques for information visualisation. Inf Vis 12(3\u20134):324\u2013357. https:\/\/doi.org\/10.1177\/1473871612455749","journal-title":"Inf Vis"},{"key":"991_CR12","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-030-92931-2_27","volume-title":"Graph drawing and network visualization","author":"L Giovannangeli","year":"2021","unstructured":"Giovannangeli L, Lalanne F, Auber D, Giot R, Bourqui R (2021) Deep neural network for drawing networks, $${(DNN)^{\\mathit{2}\\,}}$$. Graph drawing and network visualization. Springer International Publishing, Cham, pp 375\u2013390"},{"key":"991_CR13","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2022.3222186","author":"L Giovannangeli","year":"2022","unstructured":"Giovannangeli L, Lalanne F, Auber D, Giot R, Bourqui R (2022) Toward efficient deep learning for graph drawing (DL4GD). IEEE Trans Vis Comput Graph. https:\/\/doi.org\/10.1109\/TVCG.2022.3222186","journal-title":"IEEE Trans Vis Comput Graph"},{"key":"991_CR14","doi-asserted-by":"publisher","unstructured":"Grover A, Leskovec J (2016) Node2vec: scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201916. Association for Computing Machinery, New York, pp 855\u2013864. https:\/\/doi.org\/10.1145\/2939672.2939754","DOI":"10.1145\/2939672.2939754"},{"issue":"4","key":"991_CR15","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/MCG.2018.2881501","volume":"39","author":"H Haleem","year":"2019","unstructured":"Haleem H, Wang Y, Puri A, Wadhwa S, Qu H (2019) Evaluating the readability of force directed graph layouts: a deep learning approach. IEEE Comput Graph Appl 39(4):40\u201353. https:\/\/doi.org\/10.1109\/MCG.2018.2881501","journal-title":"IEEE Comput Graph Appl"},{"key":"991_CR16","unstructured":"Heimann M, Koutra D (2017) On generalizing neural node embedding methods to multi-network problems. In: KDD MLG workshop"},{"issue":"1","key":"991_CR17","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 et al (1989) An algorithm for drawing general undirected graphs. Inf Process Lett 31(1):7\u201315","journal-title":"Inf Process Lett"},{"issue":"1","key":"991_CR18","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1109\/TVCG.2019.2934396","volume":"26","author":"O-H Kwon","year":"2020","unstructured":"Kwon O-H, Ma K-L (2020) A deep generative model for graph layout. IEEE Trans Visual Comput Graph 26(1):665\u2013675. https:\/\/doi.org\/10.1109\/TVCG.2019.2934396","journal-title":"IEEE Trans Visual Comput Graph"},{"issue":"7553","key":"991_CR19","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1038\/nature14539","volume":"521","author":"Y LeCun","year":"2015","unstructured":"LeCun Y, Bengio Y, Hinton G (2015) Deep learning. Nature 521(7553):436\u2013444","journal-title":"Nature"},{"key":"991_CR20","doi-asserted-by":"crossref","unstructured":"Liang X, Shen X, Feng J, Lin L, Yan S (2016) Semantic object parsing with graph lstm. In: Leibe B, Matas J, Sebe N, Welling M (eds) Computer vision\u2014ECCV 2016. Springer International Publishing, Cham, pp 125\u2013143","DOI":"10.1007\/978-3-319-46448-0_8"},{"issue":"3","key":"991_CR21","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1111\/cgf.14003","volume":"39","author":"A Meidiana","year":"2020","unstructured":"Meidiana A, Hong S-H, Torkel M, Cai S, Eades P (2020) Sublinear time force computation for big complex network visualization. Comput Graph Forum 39(3):579\u2013591. https:\/\/doi.org\/10.1111\/cgf.14003","journal-title":"Comput Graph Forum"},{"key":"991_CR22","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 (2004) An energy model for visual graph clustering. In: Liotta G (ed) Graph drawing. Springer, Berlin, pp 425\u2013436"},{"key":"991_CR23","doi-asserted-by":"publisher","unstructured":"Ohsaka N, Sonobe T, Fujita S, Kawarabayashi K-i (2017) Coarsening massive influence networks for scalable diffusion analysis. In: Proceedings of the 2017 ACM international conference on management of data, SIGMOD \u201917. Association for Computing Machinery, New York, pp 635\u2013650. https:\/\/doi.org\/10.1145\/3035918.3064045","DOI":"10.1145\/3035918.3064045"},{"key":"991_CR24","doi-asserted-by":"publisher","unstructured":"Perozzi B, Al-Rfou R, Skiena S (2014) Deepwalk: online learning of social representations. In: Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201914. Association for Computing Machinery, New York, pp 701\u2013710. https:\/\/doi.org\/10.1145\/2623330.2623732","DOI":"10.1145\/2623330.2623732"},{"key":"991_CR25","doi-asserted-by":"publisher","DOI":"10.1201\/b15385","volume-title":"Handbook of graph drawing and visualization","author":"R Tamassia","year":"2013","unstructured":"Tamassia R (2013) Handbook of graph drawing and visualization. CRC Press, Boca Raton"},{"key":"991_CR26","first-page":"451","volume-title":"Multilayer perceptron (MLP)","author":"H Taud","year":"2018","unstructured":"Taud H, Mas J (2018) Multilayer perceptron (MLP). Springer International Publishing, Cham, pp 451\u2013455"},{"key":"991_CR27","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3184967","author":"M Tiezzi","year":"2022","unstructured":"Tiezzi M, Ciravegna G, Gori M (2022) Graph neural networks for graph drawing. IEEE Trans Neural Netw Learn Syst. https:\/\/doi.org\/10.1109\/TNNLS.2022.3184967","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"1","key":"991_CR28","doi-asserted-by":"publisher","first-page":"5233","DOI":"10.1038\/s41598-019-41695-z","volume":"9","author":"VA Traag","year":"2019","unstructured":"Traag VA, Waltman L, Van Eck NJ (2019) From Louvain to Leiden: guaranteeing well-connected communities. Sci Rep 9(1):5233","journal-title":"Sci Rep"},{"issue":"1","key":"991_CR29","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"3","author":"WT Tutte","year":"1963","unstructured":"Tutte WT (1963) How to draw a graph. Proc Lond Math Soc 3(1):743\u2013767","journal-title":"Proc Lond Math Soc"},{"key":"991_CR30","first-page":"2579","volume":"9","author":"L Van der Maaten","year":"2008","unstructured":"Van der Maaten L, Hinton G (2008) Visualizing data using t-SNE. J Mach Learn Res 9:2579","journal-title":"J Mach Learn Res"},{"issue":"5","key":"991_CR31","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/MCG.2021.3093908","volume":"41","author":"X Wang","year":"2021","unstructured":"Wang X, Yen K, Hu Y, Shen H-W (2021) DeepGD: a deep learning framework for graph drawing using GNN. IEEE Comput Graph Appl 41(5):32\u201344. https:\/\/doi.org\/10.1109\/MCG.2021.3093908","journal-title":"IEEE Comput Graph Appl"},{"issue":"1","key":"991_CR32","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1109\/TVCG.2019.2934798","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 Visual Comput Graph 26(1):676\u2013686. https:\/\/doi.org\/10.1109\/TVCG.2019.2934798","journal-title":"IEEE Trans Visual Comput Graph"},{"key":"991_CR33","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/j.neucom.2015.08.104","volume":"184","author":"Y Wang","year":"2016","unstructured":"Wang Y, Yao H, Zhao S (2016) Auto-encoder based dimensionality reduction. Neurocomputing 184:232\u2013242. https:\/\/doi.org\/10.1016\/j.neucom.2015.08.104","journal-title":"Neurocomputing"},{"issue":"1","key":"991_CR34","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TNNLS.2020.2978386","volume":"32","author":"Z Wu","year":"2021","unstructured":"Wu Z, Pan S, Chen F, Long G, Zhang C, Yu PS (2021) A comprehensive survey on graph neural networks. IEEE Trans Neural Netw Learn Syst 32(1):4\u201324. https:\/\/doi.org\/10.1109\/TNNLS.2020.2978386","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"991_CR35","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.patcog.2019.01.006","volume":"90","author":"Z Wu","year":"2019","unstructured":"Wu Z, Shen C, van den Hengel A (2019) Wider or deeper: revisiting the resnet model for visual recognition. Pattern Recogn 90:119\u2013133. https:\/\/doi.org\/10.1016\/j.patcog.2019.01.006","journal-title":"Pattern Recogn"},{"key":"991_CR36","unstructured":"Xie C, Tan M, Gong B, Yuille A, Le QV (2021) Smooth adversarial training"},{"issue":"1","key":"991_CR37","doi-asserted-by":"publisher","first-page":"886","DOI":"10.1109\/TVCG.2022.3209371","volume":"29","author":"M Xue","year":"2023","unstructured":"Xue M, Wang Z, Zhong F, Wang Y, Xu M, Deussen O, Wang Y (2023) Taurus: towards a unified force representation and universal solver for graph layout. IEEE Trans Visual Comput Graph 29(1):886\u2013895. https:\/\/doi.org\/10.1109\/TVCG.2022.3209371","journal-title":"IEEE Trans Visual Comput Graph"},{"key":"991_CR38","unstructured":"You J, Ying R, Ren X, Hamilton W, Leskovec J (2018) GraphRNN: generating realistic graphs with deep auto-regressive models. In: Dy J, Krause A (eds) Proceedings of the 35th international conference on machine learning, vol 80. PMLR, 10\u201315 July, pp 5708\u20135717"},{"key":"991_CR39","doi-asserted-by":"publisher","unstructured":"Zellmann S, Weier M, Wald I (2020) Accelerating force-directed graph drawing with rt cores. In: 2020 IEEE visualization conference (VIS), pp 96\u2013100. https:\/\/doi.org\/10.1109\/VIS47514.2020.00026","DOI":"10.1109\/VIS47514.2020.00026"},{"issue":"2","key":"991_CR40","doi-asserted-by":"publisher","first-page":"1698","DOI":"10.1109\/TVCG.2020.3030428","volume":"27","author":"Y Zhao","year":"2021","unstructured":"Zhao Y, Jiang H, Chen Q, Qin Y, Xie H, Wu Y, Liu S, Zhou Z, Xia J, Zhou F (2021) Preserving minority structures in graph sampling. IEEE Trans Visual Comput Graph 27(2):1698\u20131708. https:\/\/doi.org\/10.1109\/TVCG.2020.3030428","journal-title":"IEEE Trans Visual Comput Graph"},{"issue":"2","key":"991_CR41","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1109\/TST.2013.6509098","volume":"18","author":"H Zhou","year":"2013","unstructured":"Zhou H, Xu P, Yuan X, Qu H (2013) Edge bundling in information visualization. Tsinghua Sci Technol 18(2):145\u2013156. https:\/\/doi.org\/10.1109\/TST.2013.6509098","journal-title":"Tsinghua Sci Technol"}],"container-title":["Journal of Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12650-024-00991-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12650-024-00991-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12650-024-00991-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T16:30:24Z","timestamp":1726245024000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12650-024-00991-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,31]]},"references-count":41,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["991"],"URL":"https:\/\/doi.org\/10.1007\/s12650-024-00991-1","relation":{},"ISSN":["1343-8875","1875-8975"],"issn-type":[{"value":"1343-8875","type":"print"},{"value":"1875-8975","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,31]]},"assertion":[{"value":"22 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 December 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}