{"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":1781884941567,"version":"3.54.5"},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2018,5,1]],"date-time":"2018-05-01T00:00:00Z","timestamp":1525132800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"DFG"},{"name":"DFG","award":["ME 3619\/3-1"],"award-info":[{"award-number":["ME 3619\/3-1"]}]},{"name":"DFG","award":["SA 933\/10-1"],"award-info":[{"award-number":["SA 933\/10-1"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Visual. Comput. Graphics"],"published-print":{"date-parts":[[2018,5,1]]},"DOI":"10.1109\/tvcg.2017.2689016","type":"journal-article","created":{"date-parts":[[2017,3,31]],"date-time":"2017-03-31T18:42:31Z","timestamp":1490985751000},"page":"1814-1827","source":"Crossref","is-referenced-by-count":15,"title":["Drawing Large Graphs by Multilevel Maxent-Stress Optimization"],"prefix":"10.1109","volume":"24","author":[{"given":"Henning","family":"Meyerhenke","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0454-3937","authenticated-orcid":false,"given":"Martin","family":"Nollenburg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2823-3506","authenticated-orcid":false,"given":"Christian","family":"Schulz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","article-title":"The University of Florida sparse matrix collection","author":"davis","year":"2008"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.036106"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/iV.2015.56"},{"key":"ref32","first-page":"25","article-title":"A scalable parallel force-directed graph layout algorithm","author":"tikhonova","year":"2008","journal-title":"Proc Eurographics Parallel Graphics and Vis Symp"},{"key":"ref31","first-page":"83","article-title":"Distributed force-directed graph layout and visualization","author":"mueller","year":"2006","journal-title":"Proc Eurographics Parallel Graphics and Vis Symp"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2008.85"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07959-2_30"},{"key":"ref36","author":"trottenberg","year":"2000","journal-title":"Multigrid"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-50106-2_1"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.11.012"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974690.ch1"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOGO.0000042115.44455.f3"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70904-6_6"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1002\/wics.1343"},{"key":"ref13","first-page":"383","article-title":"Force-directed drawing algorithms","author":"kobourov","year":"2013","journal-title":"Handbook of Graph Drawing and Visualization"},{"key":"ref14","first-page":"146","article-title":"A heuristic for graph drawing","volume":"42","author":"eades","year":"1984","journal-title":"Congressus Numerantium"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380211102"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1038\/324446a0"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289565"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(89)90102-6"},{"key":"ref19","first-page":"29","article-title":"Glint: An MDS framework for costly distance functions","author":"ingram","year":"2012","journal-title":"Proc Swedish Comput Graph Assoc"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2007.70580"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2503210.2503280"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-18469-7_8"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/VL.1996.545307"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2012.299"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00219-9_10"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/978-3-540-31843-9_25","article-title":"Graph drawing by stress majorization","author":"gansner","year":"2005","journal-title":"Graph Drawing"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2011.05.013"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-20086-6_16"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2006.120"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/110843563"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-27261-0_3"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-50106-2_2"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00070"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03841-4_24"},{"key":"ref42","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/978-1-4614-6170-8_23","article-title":"A benchmark set for graph clustering and graph partitioning","author":"bader","year":"2014","journal-title":"Encyclopaedia of Social Network Analysis and Mining"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31843-9_29"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2010.5470485"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44541-2_19"},{"key":"ref44","author":"bergamini","year":"0"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00150"},{"key":"ref43","volume":"74","author":"demetrescu","year":"2009","journal-title":"Proc 9th DIMACS Implementation Challenge Shortest Paths"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00052"}],"container-title":["IEEE Transactions on Visualization and Computer Graphics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/2945\/8326693\/07889042.pdf?arnumber=7889042","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:23:41Z","timestamp":1642004621000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7889042\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,1]]},"references-count":44,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tvcg.2017.2689016","relation":{},"ISSN":["1077-2626"],"issn-type":[{"value":"1077-2626","type":"print"}],"subject":[],"published":{"date-parts":[[2018,5,1]]}}}