{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T20:07:41Z","timestamp":1760731661515,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1109\/ssci.2017.8285432","type":"proceedings-article","created":{"date-parts":[[2018,2,12]],"date-time":"2018-02-12T22:52:06Z","timestamp":1518475926000},"page":"1-7","source":"Crossref","is-referenced-by-count":0,"title":["Three-dimensional graph drawing by Kamada-Kawai method with Barzilai-Borwein method"],"prefix":"10.1109","author":[{"given":"Martin","family":"Hasal","sequence":"first","affiliation":[]},{"given":"Jana","family":"Nowakova","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Platos","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1063\/1.4952138"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44541-2_18"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/IV.2012.78"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44541-2_17"},{"journal-title":"Classical Mechanics","year":"2005","author":"taylor","key":"ref14"},{"journal-title":"Introduction to Algorithms","year":"2001","author":"leiserson","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/8.1.141"},{"journal-title":"Convergence Properties of the Barzilai and Borwein Gradient Method","year":"1991","author":"raydan","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00389-9"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/INCoS.2015.66"},{"key":"ref4","article-title":"Spring embedders and force directed graph drawing algorithms","volume":"abs 1201 3011","author":"kobourov","year":"2012","journal-title":"CoRR"},{"journal-title":"Visualizing Graph Data","year":"2016","author":"lanum","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/234535.234538"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380211102"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(89)90102-6"},{"key":"ref7","first-page":"388","article-title":"A fast adaptive layout algorithm for undirected graphs (extended abstract and system demonstration)","author":"frick","year":"1994","journal-title":"International Symposium on Graph Drawing"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2739482.2768443"},{"key":"ref1","first-page":"187","article-title":"Graph-based analysis of evolutionary algorithm-preliminary resulte","volume":"4","author":"walczak","year":"2004","journal-title":"KAEiOG"},{"key":"ref9","first-page":"76","article-title":"An experimental comparison of force-directed and randomized graph drawing algorithms","author":"brandenburg","year":"1995","journal-title":"Graph Drawing"}],"event":{"name":"2017 IEEE Symposium Series on Computational Intelligence (SSCI)","start":{"date-parts":[[2017,11,27]]},"location":"Honolulu, HI","end":{"date-parts":[[2017,12,1]]}},"container-title":["2017 IEEE Symposium Series on Computational Intelligence (SSCI)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8267146\/8280782\/08285432.pdf?arnumber=8285432","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,3,16]],"date-time":"2018-03-16T16:03:03Z","timestamp":1521216183000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8285432\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/ssci.2017.8285432","relation":{},"subject":[],"published":{"date-parts":[[2017,11]]}}}