{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T16:02:21Z","timestamp":1781884941558,"version":"3.54.5"},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP180102553"],"award-info":[{"award-number":["DP180102553"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Visual. Comput. Graphics"],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1109\/tvcg.2022.3233287","type":"journal-article","created":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T18:57:29Z","timestamp":1672685849000},"page":"3386-3399","source":"Crossref","is-referenced-by-count":2,"title":["SubLinearForce: Fully Sublinear-Time Force Computation for Large Complex Graph Drawing"],"prefix":"10.1109","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7196-2309","authenticated-orcid":false,"given":"Amyra","family":"Meidiana","sequence":"first","affiliation":[{"name":"University of Sydney, Sydney, NSW, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1698-3868","authenticated-orcid":false,"given":"Seok-Hee","family":"Hong","sequence":"additional","affiliation":[{"name":"University of Sydney, Sydney, NSW, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shijun","family":"Cai","sequence":"additional","affiliation":[{"name":"University of Sydney, Sydney, NSW, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marnijati","family":"Torkel","sequence":"additional","affiliation":[{"name":"University of Sydney, Sydney, NSW, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Eades","sequence":"additional","affiliation":[{"name":"University of Sydney, Sydney, NSW, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/PacificVis52677.2021.00027"},{"key":"ref2","first-page":"149","article-title":"A heuristic for graph drawing","volume":"42","author":"Eades","year":"1984","journal-title":"Congressus Numerantium"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380211102"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-2864-4_648"},{"key":"ref5","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"Battista","year":"1998"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1201\/b15385"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44541-2_19"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31843-9_29"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44541-2_21"},{"issue":"1","key":"ref10","first-page":"37","article-title":"Efficient, high-quality force-directed graph drawing","volume":"10","author":"Hu","year":"2005","journal-title":"Mathematica"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1038\/324446a0"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.13724"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/LDAV48142.2019.8944364"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.14003"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/08074489X"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1006\/jvlc.1995.1013"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-13.1.743"},{"key":"ref18","article-title":"Spring embedders and force directed graph drawing algorithms","author":"Kobourov","year":"2012"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44541-2_17"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2007.46"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/PACIFICVIS.2017.8031574"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-27261-0_3"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-35802-0_11"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-50106-2_1"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2011.185"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.56"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/080734029"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9781107337510.015"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1049\/el:19740097"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00405"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1111\/j.1469-8137.1912.tb05611.x"},{"key":"ref32","doi-asserted-by":"crossref","DOI":"10.25080\/TCWV9851","article-title":"Exploring network structure, dynamics, and function using networkx","author":"Hagberg","year":"2008"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-7163-9_315-1"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(89)90102-6"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31843-9_25"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2018.2859997"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-50106-2_2"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/PacificVis52677.2021.00030"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150479"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2016.2598867"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/PacificVis.2018.00011"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/LDAV48142.2019.8944358"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-73915-1_22"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-36683-4_18"},{"key":"ref45","first-page":"1843","article-title":"Graph sampling methods for big complex networks integrating centrality, k-core, and spectral sparsification","volume-title":"Proc. Symp. Appl. Comput.","author":"Hong"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2008.01232.x"}],"container-title":["IEEE Transactions on Visualization and Computer Graphics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/2945\/10576039\/10005087.pdf?arnumber=10005087","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T19:09:05Z","timestamp":1743793745000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10005087\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7]]},"references-count":46,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tvcg.2022.3233287","relation":{},"ISSN":["1077-2626","1941-0506","2160-9306"],"issn-type":[{"value":"1077-2626","type":"print"},{"value":"1941-0506","type":"electronic"},{"value":"2160-9306","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7]]}}}