{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,19]],"date-time":"2026-10-19T03:35:59Z","timestamp":1792380959909,"version":"4.4.0"},"reference-count":14,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2015,11,15]],"date-time":"2015-11-15T00:00:00Z","timestamp":1447545600000},"content-version":"vor","delay-in-days":318,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Procedia Computer Science"],"published-print":{"date-parts":[[2015]]},"DOI":"10.1016\/j.procs.2015.11.078","type":"journal-article","created":{"date-parts":[[2015,11,27]],"date-time":"2015-11-27T23:59:35Z","timestamp":1448668775000},"page":"689-696","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":10,"special_numbering":"C","title":["Improved Force-Directed Method of Graph Layout Generation with Adaptive Step Length"],"prefix":"10.1016","volume":"66","author":[{"given":"Dmitry","family":"Egorov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexey","family":"Bezgodov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.procs.2015.11.078_bib0005","unstructured":"Eades, P. (1984). A Heuristic for Graph Drawing. Congressus Nutnerantiunt, 42, 149-160."},{"issue":"11","key":"10.1016\/j.procs.2015.11.078_bib0010","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1002\/spe.4380211102","article-title":"Graph drawing by force-directed placement","volume":"21","author":"T. Fruchterman","year":"1991","journal-title":"Softw., Pract. Exper."},{"issue":"1","key":"10.1016\/j.procs.2015.11.078_bib0015","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0020-0190(89)90102-6","article-title":"An algorithm for drawing general undirected graphs","volume":"31","author":"Kamada","year":"1989","journal-title":"Information processing letters"},{"issue":"1","key":"10.1016\/j.procs.2015.11.078_bib0020","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0166-218X(00)00389-9","article-title":"A multi-scale algorithm for drawing graphs nicely","volume":"113","author":"Hadany","year":"2001","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.procs.2015.11.078_bib0025","doi-asserted-by":"crossref","unstructured":"Harel, D., & Koren, Y. (2001, January). A fast multi-scale method for drawing large graphs. In Graph drawing (pp. 183-196). Springer Berlin Heidelberg.","DOI":"10.1007\/3-540-44541-2_18"},{"key":"10.1016\/j.procs.2015.11.078_bib0030","doi-asserted-by":"crossref","unstructured":"Walshaw, C. (2001, January). A multilevel algorithm for force-directed graph drawing. In Graph Drawing (pp. 171-182). Springer Berlin Heidelberg.","DOI":"10.1007\/3-540-44541-2_17"},{"key":"10.1016\/j.procs.2015.11.078_bib0035","doi-asserted-by":"crossref","unstructured":"Floyd, Robert W. (1962). Algorithm 97: Shortest Path. Communications of the ACM, 5(6), 345.","DOI":"10.1145\/367766.368168"},{"issue":"1","key":"10.1016\/j.procs.2015.11.078_bib0040","first-page":"37","article-title":"Efficient, high-quality force-directed graph drawing","volume":"10","author":"Hu","year":"2005","journal-title":"Mathematica Journal"},{"key":"10.1016\/j.procs.2015.11.078_bib0045","doi-asserted-by":"crossref","unstructured":"Wolfe, P. (1969). Convergence conditions for ascent methods. SIAM review, 11(2), 226-235.","DOI":"10.1137\/1011036"},{"key":"10.1016\/j.procs.2015.11.078_bib0050","unstructured":"Fast N-Body Simulation with CUDA. (n.d.). Retrieved from http:\/\/http.developer.nvidia.com\/GPUGems3\/gpugems3_ch31.html."},{"key":"10.1016\/j.procs.2015.11.078_bib0055","doi-asserted-by":"crossref","unstructured":"Ingram, S., Munzner, T., & Olano, M. (2009). Glimmer: Multilevel MDS on the GPU. Visualization and Computer Graphics, IEEE Transactions on, 15(2), 249-261.","DOI":"10.1109\/TVCG.2008.85"},{"issue":"6","key":"10.1016\/j.procs.2015.11.078_bib0060","doi-asserted-by":"crossref","first-page":"1310","DOI":"10.1109\/TVCG.2007.70580","article-title":"Multi-level graph layout on the GPU","volume":"13","author":"Frishman","year":"2007","journal-title":"Visualization and Computer Graphics, IEEE Transactions on"},{"key":"10.1016\/j.procs.2015.11.078_bib0065","unstructured":"Frishman, Y. & Tal, A. (2007). Online dynamic graph drawing. In Proc. Eurographics\/IEEE VGTC Symp. on Visualization (EuroVis\u201907)."},{"key":"10.1016\/j.procs.2015.11.078_bib0070","unstructured":"Leskovec, J., & Krevl, A. (2014). SNAP Datasets: Stanford Large Network Dataset Collection. Retrieved from http:\/\/snap.stanford.edu\/data."}],"container-title":["Procedia Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877050915034274?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877050915034274?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,9,2]],"date-time":"2019-09-02T01:03:38Z","timestamp":1567386218000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1877050915034274"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"references-count":14,"alternative-id":["S1877050915034274"],"URL":"https:\/\/doi.org\/10.1016\/j.procs.2015.11.078","relation":{},"ISSN":["1877-0509"],"issn-type":[{"value":"1877-0509","type":"print"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Improved Force-Directed Method of Graph Layout Generation with Adaptive Step Length","name":"articletitle","label":"Article Title"},{"value":"Procedia Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.procs.2015.11.078","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2015 The Authors. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}