{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T07:12:06Z","timestamp":1777360326211,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540245285","type":"print"},{"value":"9783540318439","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31843-9_25","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T20:54:14Z","timestamp":1278363254000},"page":"239-250","source":"Crossref","is-referenced-by-count":209,"title":["Graph Drawing by Stress Majorization"],"prefix":"10.1007","author":[{"given":"Emden R.","family":"Gansner","sequence":"first","affiliation":[]},{"given":"Yehuda","family":"Koren","sequence":"additional","affiliation":[]},{"given":"Stephen","family":"North","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/978-1-5041-2940-4_9","volume-title":"Quality of Numerical Software, Assessment and Enhancement","author":"R.F. Boisvert","year":"1997","unstructured":"Boisvert, R.F., et al.: The Matrix Market: A web resource for test matrix collections. In: Boisvert, R.F. (ed.) Quality of Numerical Software, Assessment and Enhancement, pp. 125\u2013137. Chapman Hall, Boca Raton (1997), \n                    \n                      math.nist.gov\/MatrixMarket"},{"key":"25_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/BFb0021792","volume-title":"Graph Drawing","author":"F.J. Brandenburg","year":"1996","unstructured":"Brandenburg, F.J., Himsolt, M., Rohrer, C.: An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol.\u00a01027, pp. 76\u201387. Springer, Heidelberg (1996)"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF01897162","volume":"5","author":"J. Leeuw De","year":"1988","unstructured":"De Leeuw, J.: Convergence of the Majorization Method for Multidimensional Scaling. Journal of Classification\u00a05, 163\u2013180 (1988)","journal-title":"Journal of Classification"},{"key":"25_CR4","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Englewood Cliffs (1999)"},{"key":"25_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2711-1","volume-title":"Modern Multidimensional Scaling: Theory and Applications","author":"I. Borg","year":"1997","unstructured":"Borg, I., Groenen, P.: Modern Multidimensional Scaling: Theory and Applications. Springer, Heidelberg (1997)"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1145\/264645.264657","volume":"4","author":"J.D. Cohen","year":"1997","unstructured":"Cohen, J.D.: Drawing Graphs to Convey Proximity: an Incremental Arrangement Method. ACM Transactions on Computer-Human Interaction\u00a04, 197\u2013229 (1997)","journal-title":"ACM Transactions on Computer-Human Interaction"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/3-540-37623-2_28","volume-title":"Graph Drawing","author":"E.R. Gansner","year":"1999","unstructured":"Gansner, E.R., North, S.C.: Improved force-directed layouts. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol.\u00a01547, pp. 364\u2013373. Springer, Heidelberg (1999)"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Gajer, P., Goodrich, M.T., Kobourov, S.G.: A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 211\u2013221. Springer, Heidelberg (2001)","DOI":"10.1007\/3-540-44541-2_20"},{"key":"25_CR9","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations. Johns Hopkins University Press (1996)"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(00)00389-9","volume":"113","author":"R. Hadany","year":"2001","unstructured":"Hadany, R., Harel, D.: A Multi-Scale Method for Drawing Graphs Nicely. Discrete Applied Mathematics\u00a0113, 3\u201321 (2001)","journal-title":"Discrete Applied Mathematics"},{"key":"25_CR11","doi-asserted-by":"crossref","first-page":"179","DOI":"10.7155\/jgaa.00051","volume":"6","author":"D. Harel","year":"2002","unstructured":"Harel, D., Koren, Y.: A Fast Multi-Scale Method for Drawing Large Graphs. Journal of Graph Algorithms and Applications\u00a06, 179\u2013202 (2002)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-36151-0_20","volume-title":"Graph Drawing","author":"D. Harel","year":"2002","unstructured":"Harel, D., Koren, Y.: Graph Drawing by High-Dimensional Embedding. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 207\u2013219. Springer, Heidelberg (2002)"},{"key":"25_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/978-3-540-24595-7_42","volume-title":"Graph Drawing","author":"Y. Koren","year":"2004","unstructured":"Koren, Y., Harel, D.: Axis-by-Axis Stress Minimization. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 450\u2013459. Springer, Heidelberg (2004)"},{"key":"25_CR14","unstructured":"Koren, Y.: Graph Drawing by Subspace Optimization. In: Proceedings 6th Joint Eurographics \u2013 IEEE TCVG Symposium Visualization (VisSym 2004). Eurographics, pp. 65\u201374 (2004)"},{"key":"25_CR15","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. Information Processing Letters\u00a031, 7\u201315 (1989)","journal-title":"Information Processing Letters"},{"key":"25_CR16","series-title":"Lecture Notes in Computer Science","volume-title":"Drawing Graphs","year":"2001","unstructured":"Kaufmann, M., Wagner, D. (eds.): Drawing Graphs. LNCS, vol.\u00a02025. Springer, Heidelberg (2001)"},{"key":"25_CR17","unstructured":"Kruskal, J., Seery, J.: Designing network diagrams. In: Proceedings First General Conference on Social Graphics, pp. 22\u201350 (1980)"},{"key":"25_CR18","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1109\/T-C.1969.222678","volume":"18","author":"J.W. Sammon","year":"1969","unstructured":"Sammon, J.W.: A Nonlinear Mapping for Data Structure Analysis. IEEE Trans. on Computers\u00a018, 401\u2013409 (1969)","journal-title":"IEEE Trans. on Computers"},{"key":"25_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/3-540-44541-2_17","volume-title":"Graph Drawing","author":"C. Walshaw","year":"2001","unstructured":"Walshaw, C.: A Multilevel Algorithm for Force-Directed Graph Drawing. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 171\u2013182. Springer, Heidelberg (2001)"},{"key":"25_CR20","unstructured":"Graphviz, \n                    \n                      http:\/\/www.research.att.com\/sw\/tools\/graphviz\/"},{"key":"25_CR21","unstructured":"Graphlet, \n                    \n                      http:\/\/www.infosun.fmi.uni-passau.de\/Graphlet\/"},{"key":"25_CR22","unstructured":"Intel Math Kernel Library, \n                    \n                      http:\/\/www.intel.com\/software\/products\/mkl\/"},{"key":"25_CR23","unstructured":"Automatically Tuned Linear Algebra Software (ATLAS), \n                    \n                      http:\/\/atlas.sourceforge.net\/"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31843-9_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:41:59Z","timestamp":1620013319000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31843-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245285","9783540318439"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31843-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}