{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:06:34Z","timestamp":1761807994230,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319272603"},{"type":"electronic","value":"9783319272610"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-27261-0_3","type":"book-chapter","created":{"date-parts":[[2015,11,26]],"date-time":"2015-11-26T01:24:59Z","timestamp":1448501099000},"page":"30-43","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Drawing Large Graphs by Multilevel Maxent-Stress Optimization"],"prefix":"10.1007","author":[{"given":"Henning","family":"Meyerhenke","sequence":"first","affiliation":[]},{"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Schulz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,27]]},"reference":[{"issue":"5","key":"3_CR1","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1109\/TVCG.2006.120","volume":"12","author":"J Abello","year":"2006","unstructured":"Abello, J., van Ham, F., Krishnan, N.: ASK-GraphView: a large scale graph visualization system. IEEE Trans. Vis. Comput. Graph. 12(5), 669\u2013676 (2006)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Bader, D.A., Meyerhenke, H., Sanders, P., Schulz, C., Kappes, A., Wagner, D.: A benchmark set for graph clustering and graph partitioning. In: Encyclopedia of Social Network Analysis and Mining (2014)","DOI":"10.1007\/978-1-4614-6170-8_23"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1038\/324446a0","volume":"324","author":"J Barnes","year":"1986","unstructured":"Barnes, J., Hut, P.: A hierarchical \n                      \n                        \n                      \n                      $$O(n \\log n)$$\n                     force-calculation algorithm. Nature 324, 446\u2013449 (1986)","journal-title":"Nature"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-18469-7_8","volume-title":"Graph Drawing","author":"G Bartel","year":"2011","unstructured":"Bartel, G., Gutwenger, C., Klein, K., Mutzel, P.: An experimental evaluation of multilevel layout methods. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol. 6502, pp. 80\u201391. Springer, Heidelberg (2011)"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","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.: Eigensolver methods for progressive multidimensional scaling of large data. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 42\u201353. Springer, Heidelberg (2007)"},{"key":"3_CR6","unstructured":"Davis, T.: The university of florida sparse matrix collection (2008). \n                      http:\/\/www.cise.ufl.edu\/research\/sparse\/matrices"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Demetrescu, C., Goldberg, A.V., Johnson, D.S.: The Shortest Path Problem: 9th DIMACS Implementation Challenge, vol. 74. AMS (2009)","DOI":"10.1090\/dimacs\/074"},{"key":"3_CR8","first-page":"146","volume":"42","author":"P Eades","year":"1984","unstructured":"Eades, P.: A heuristic for graph drawing. Congressus Numerantium 42, 146\u2013160 (1984)","journal-title":"Congressus Numerantium"},{"issue":"6","key":"3_CR9","doi-asserted-by":"publisher","first-page":"1310","DOI":"10.1109\/TVCG.2007.70580","volume":"13","author":"Y Frishman","year":"2007","unstructured":"Frishman, Y., Tal, A.: Multi-level graph layout on the GPU. IEEE Trans. Vis. Comput. Graph. 13(6), 1310\u20131319 (2007)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"11","key":"3_CR10","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"TMJ Fruchterman","year":"1991","unstructured":"Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force-directed placement. Softw. Pract. Exp. 21(11), 1129\u20131164 (1991)","journal-title":"Softw. Pract. Exp."},{"issue":"3","key":"3_CR11","doi-asserted-by":"publisher","first-page":"202","DOI":"10.7155\/jgaa.00052","volume":"6","author":"P Gajer","year":"2002","unstructured":"Gajer, P., Kobourov, S.G.: GRIP: Graph drawing with intelligent placement. J. Graph Algorithms Appl. 6(3), 202\u2013224 (2002)","journal-title":"J. Graph Algorithms Appl."},{"issue":"6","key":"3_CR12","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1109\/TVCG.2012.299","volume":"19","author":"ER Gansner","year":"2013","unstructured":"Gansner, E.R., Hu, Y., North, S.C.: A maxent-stress model for graph layout. IEEE Trans. Vis. Comput. Graph. 19(6), 927\u2013940 (2013)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","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, E.R., Koren, Y., North, S.C.: Graph drawing by stress majorization. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 239\u2013250. Springer, Heidelberg (2005)"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-00219-9_10","volume-title":"Graph Drawing","author":"A Godiyal","year":"2009","unstructured":"Godiyal, A., Hoberock, J., Garland, M., Hart, J.C.: Rapid multipole graph drawing on the GPU. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 90\u2013101. Springer, Heidelberg (2009)"},{"issue":"2","key":"3_CR15","doi-asserted-by":"publisher","first-page":"345","DOI":"10.7155\/jgaa.00150","volume":"11","author":"S Hachul","year":"2007","unstructured":"Hachul, S., J\u00fcnger, M.: Large-graph layout algorithms at work: an experimental study. J. Graph Algorithms Appl. 11(2), 345\u2013369 (2007)","journal-title":"J. Graph Algorithms Appl."},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-540-31843-9_29","volume-title":"Graph Drawing","author":"S Hachul","year":"2005","unstructured":"Hachul, S., J\u00fcnger, M.: Drawing large graphs with a potential-field-based multilevel algorithm. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 285\u2013295. Springer, Heidelberg (2005)"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Holtgrewe, M., Sanders, P., Schulz, C.: Engineering a scalable high quality graph partitioner. In: IEEE Parallel and Distributed Computing (IPDPS 2010), pp. 1\u201312. IEEE (2010)","DOI":"10.1109\/IPDPS.2010.5470485"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-319-20086-6_16","volume-title":"Experimental Algorithms","author":"D Hoske","year":"2015","unstructured":"Hoske, D., Lukarski, D., Meyerhenke, H., Wegner, M.: Is nearly-linear the same in theory and practice? a case study with a combinatorial laplacian solver. In: Bampis, E. (ed.) SEA 2015. LNCS, vol. 9125, pp. 205\u2013218. Springer, Heidelberg (2015)"},{"issue":"2","key":"3_CR19","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1002\/wics.1343","volume":"7","author":"Y Hu","year":"2015","unstructured":"Hu, Y., Shi, L.: Visualizing large graphs. Wiley Interdisc. Rev. Comput. Stat. 7(2), 115\u2013136 (2015)","journal-title":"Wiley Interdisc. Rev. Comput. Stat."},{"issue":"2","key":"3_CR20","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1109\/TVCG.2008.85","volume":"15","author":"S Ingram","year":"2009","unstructured":"Ingram, S., Munzner, T., Olano, M.: Glimmer: multilevel MDS on the GPU. IEEE Trans. Vis. Comput. Graph. 15(2), 249\u2013261 (2009)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"3_CR21","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.: An algorithm for drawing general undirected graphs. Inf. Process. Lett. 31, 7\u201315 (1989)","journal-title":"Inf. Process. Lett."},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Kirmani, S., Raghavan, P.: Scalable parallel graph partitioning. In: High Performance Computing, Networking, Storage and Analysis (S 2013), pp. 51:1\u201351:10. ACM (2013)","DOI":"10.1145\/2503210.2503280"},{"key":"3_CR23","first-page":"383","volume-title":"Handbook of Graph Drawing and Visualization, Chap. 12","author":"SG Kobourov","year":"2013","unstructured":"Kobourov, S.G.: Force-directed drawing algorithms. In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization, Chap. 12, pp. 383\u2013408. CRC Press, Boca Raton (2013)"},{"issue":"12","key":"3_CR24","doi-asserted-by":"publisher","first-page":"1638","DOI":"10.1016\/j.cviu.2011.05.013","volume":"115","author":"I Koutis","year":"2011","unstructured":"Koutis, I., Miller, G.L., Tolliver, D.: Combinatorial preconditioners and multilevel solvers for problems in computer vision and image processing. Comput. Vis. Image Underst. 115(12), 1638\u20131646 (2011)","journal-title":"Comput. Vis. Image Underst."},{"issue":"1","key":"3_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02289565","volume":"29","author":"JB Kruskal","year":"1964","unstructured":"Kruskal, J.B.: Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis. Psychometrika 29(1), 1\u201327 (1964)","journal-title":"Psychometrika"},{"issue":"4","key":"3_CR26","doi-asserted-by":"publisher","first-page":"B499","DOI":"10.1137\/110843563","volume":"34","author":"OE Livne","year":"2012","unstructured":"Livne, O.E., Brandt, A.: Lean algebraic multigrid (LAMG): fast graph Laplacian linear solver. SIAM J. Sci. Comput. 34(4), B499\u2013B522 (2012)","journal-title":"SIAM J. Sci. Comput."},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Meyerhenke, H., N\u00f6llenburg, M., Schulz, C.: Drawing large graphs by multilevel maxent-stress optimization. CoRR, \n                      arXiv:1506.04383\n                      \n                     (2015)","DOI":"10.1007\/978-3-319-27261-0_3"},{"key":"3_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/978-3-319-07959-2_30","volume-title":"Experimental Algorithms","author":"H Meyerhenke","year":"2014","unstructured":"Meyerhenke, H., Sanders, P., Schulz, C.: Partitioning complex networks via size-constrained clustering. In: Gudmundsson, J., Katajainen, J. (eds.) SEA 2014. LNCS, vol. 8504, pp. 351\u2013363. Springer, Heidelberg (2014)"},{"key":"3_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/3-540-44541-2_19","volume-title":"Graph Drawing","author":"A Quigley","year":"2001","unstructured":"Quigley, A., Eades, P.: FADE: graph drawing, clustering, and visual abstraction. In: Marks, J. (ed.) GD 2000. LNCS, vol. 1984, pp. 197\u2013210. Springer, Heidelberg (2001)"},{"issue":"3","key":"3_CR30","doi-asserted-by":"publisher","first-page":"036106","DOI":"10.1103\/PhysRevE.76.036106","volume":"76","author":"UN Raghavan","year":"2007","unstructured":"Raghavan, U.N., Albert, R., Kumara, S.: Near linear time algorithm to detect community structures in large-scale networks. Phy. Rev. E 76(3), 036106 (2007)","journal-title":"Phy. Rev. E"},{"issue":"2","key":"3_CR31","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1023\/B:JOGO.0000042115.44455.f3","volume":"29","author":"AJ Soper","year":"2004","unstructured":"Soper, A.J., Walshaw, C., Cross, M.: A combined evolutionary search and multilevel optimisation approach to graph-partitioning. J. Global Optim. 29(2), 225\u2013241 (2004)","journal-title":"J. Global Optim."},{"issue":"3","key":"3_CR32","doi-asserted-by":"publisher","first-page":"253","DOI":"10.7155\/jgaa.00070","volume":"7","author":"C Walshaw","year":"2003","unstructured":"Walshaw, C.: A multilevel algorithm for force-directed graph-drawing. J. Graph Algorithms Appl. 7(3), 253\u2013285 (2003)","journal-title":"J. Graph Algorithms Appl."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27261-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,23]],"date-time":"2019-09-23T20:10:48Z","timestamp":1569269448000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27261-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319272603","9783319272610"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27261-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"27 November 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}