{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T07:46:47Z","timestamp":1769586407754,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642002182","type":"print"},{"value":"9783642002199","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00219-9_21","type":"book-chapter","created":{"date-parts":[[2009,2,4]],"date-time":"2009-02-04T13:03:51Z","timestamp":1233752631000},"page":"218-229","source":"Crossref","is-referenced-by-count":53,"title":["An Experimental Study on Distance-Based Graph Drawing"],"prefix":"10.1007","author":[{"given":"Ulrik","family":"Brandes","sequence":"first","affiliation":[]},{"given":"Christian","family":"Pich","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","volume-title":"Modern Multidimensional Scaling","author":"I. Borg","year":"2005","unstructured":"Borg, I., Groenen, P.J.F.: Modern Multidimensional Scaling, 2nd edn. Springer, Heidelberg (2005)","edition":"2"},{"key":"21_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":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/3-540-44969-8_4","volume-title":"Drawing Graphs","author":"U. Brandes","year":"2001","unstructured":"Brandes, U.: Drawing on physical analogies. In: Kaufmann, M., Wagner, D. (eds.) Drawing Graphs. LNCS, vol.\u00a02025, pp. 71\u201386. Springer, Heidelberg (2001)"},{"key":"21_CR4","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.\u00a04372, pp. 42\u201353. Springer, Heidelberg (2007)"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/s00357-001-0031-0","volume":"19","author":"A. Buja","year":"2002","unstructured":"Buja, A., Swayne, D.F.: Visualization methodology for multidimensional scaling. Journal of Classification\u00a019, 7\u201343 (2002)","journal-title":"Journal of Classification"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-540-70904-6_5","volume-title":"Graph Drawing","author":"A. Civril","year":"2007","unstructured":"Civril, A., Magdon-Ismail, M., Bocek-Rivele, E.: SSDE: Fast graph drawing using sampled spectral distance embedding. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol.\u00a04372, pp. 30\u201341. Springer, Heidelberg (2007)"},{"issue":"3","key":"21_CR7","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. ACM Transactions on Computer-Human Interaction\u00a04(3), 197\u2013229 (1997)","journal-title":"ACM Transactions on Computer-Human Interaction"},{"key":"21_CR8","volume-title":"Multidimensional Scaling","author":"T.F. Cox","year":"2001","unstructured":"Cox, T.F., Cox, M.A.A.: Multidimensional Scaling, 2nd edn. CRC\/Chapman and Hall, Boca Raton (2001)","edition":"2"},{"issue":"2","key":"21_CR9","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0166-218X(90)90110-X","volume":"28","author":"P. Eades","year":"1990","unstructured":"Eades, P., Wormald, N.C.: Fixed edge-length graph drawing is NP-hard. Discrete Applied Mathematics\u00a028(2), 111\u2013134 (1990)","journal-title":"Discrete Applied Mathematics"},{"key":"21_CR10","unstructured":"Freeman, L.C.: Graph layout techniques and multidimensional analysis. Journal of Social Structure\u00a01 (2000)"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-44541-2_21","volume-title":"Graph Drawing","author":"P. Gajer","year":"2001","unstructured":"Gajer, P., Kobourov, S.: GRIP \u2013 Graph drawing with intelligent placement. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 222\u2013228. Springer, Heidelberg (2001)"},{"key":"21_CR12","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":"E.R. 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.\u00a03383, pp. 239\u2013250. Springer, Heidelberg (2005)"},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/11618058_22","volume-title":"Graph Drawing","author":"S. Hachul","year":"2006","unstructured":"Hachul, S., J\u00fcnger, M.: An experimental comparison of fast algorithms for drawing general large graphs. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 235\u2013250. Springer, Heidelberg (2006)"},{"key":"21_CR14","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":"21_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":"21_CR16","unstructured":"Kruskal, J.B., Seery, J.B.: Designing network diagrams. In: Proc. First General Conference on Social Graphics, pp. 22\u201350 (1980)"},{"issue":"1","key":"21_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02289565","volume":"29","author":"J.B. Kruskal","year":"1964","unstructured":"Kruskal, J.B.: Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis. Psychometrika\u00a029(1), 1\u201327 (1964)","journal-title":"Psychometrika"},{"key":"21_CR18","first-page":"133","volume-title":"Recent Developments in Statistics","author":"J. Leeuw de","year":"1977","unstructured":"de Leeuw, J.: Applications of convex analysis to multidimensional scaling. In: Barra, J.R., Brodeau, F., Romier, G., van Cutsem, B. (eds.) Recent Developments in Statistics, pp. 133\u2013145. North-Holland, Amsterdam (1977)"},{"key":"21_CR19","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1111\/j.2044-8317.1966.tb00367.x","volume":"19","author":"V.E. McGee","year":"1966","unstructured":"McGee, V.E.: The multidimensional scaling of \u201celastic\u201d distances. Br. J. Math. Stat. Psychol.\u00a019, 181\u2013196 (1966)","journal-title":"Br. J. Math. Stat. Psychol."},{"issue":"5","key":"21_CR20","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 Transactions on Computers\u00a018(5), 401\u2013409 (1969)","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"21_CR21","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1111\/j.2517-6161.1978.tb01669.x","volume":"40","author":"R. Sibson","year":"1978","unstructured":"Sibson, R.: Studies in the robustness of multidimensional scaling: Procrustes statistics. J. R. Stat. Sooc.\u00a040(2), 234\u2013238 (1978)","journal-title":"J. R. Stat. Sooc."},{"key":"21_CR22","unstructured":"de Silva, V., Tenenbaum, J.B.: Sparse multidimensional scaling using landmark points. Tech. rep., Stanford University (2004)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00219-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,7]],"date-time":"2025-02-07T11:10:38Z","timestamp":1738926638000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00219-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002182","9783642002199"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00219-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}