{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T02:05:32Z","timestamp":1725761132312},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319038407"},{"type":"electronic","value":"9783319038414"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03841-4_24","type":"book-chapter","created":{"date-parts":[[2013,12,2]],"date-time":"2013-12-02T00:28:55Z","timestamp":1385944135000},"page":"268-279","source":"Crossref","is-referenced-by-count":11,"title":["COAST: A Convex Optimization Approach to Stress-Based Embedding"],"prefix":"10.1007","author":[{"given":"Emden R.","family":"Gansner","sequence":"first","affiliation":[]},{"given":"Yifan","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Shankar","family":"Krishnan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","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":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-00219-9_21","volume-title":"Graph Drawing","author":"U. Brandes","year":"2009","unstructured":"Brandes, U., Pich, C.: An experimental study on distance-based graph drawing. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol.\u00a05417, pp. 218\u2013229. Springer, Heidelberg (2009)"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1198\/jasa.2009.0111","volume":"104","author":"L. Chen","year":"2009","unstructured":"Chen, L., Buja, A.: Local multidimensional scaling for nonlinear dimension reduction, graph drawing, and proximity analysis. J. Amer. Statistical Assoc.\u00a0104, 209\u2013219 (2009)","journal-title":"J. Amer. Statistical Assoc."},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Chung, F.R.K.: Spectral Graph Theory (CBMS Regional Conference Series in Mathematics, No. 92). American Mathematical Society, Providene (1996)","DOI":"10.1090\/cbms\/092"},{"key":"24_CR5","first-page":"1","volume":"38","author":"T.A. Davis","year":"2011","unstructured":"Davis, T.A., Hu, Y.: U. of Florida Sparse Matrix Collection. ACM Transaction on Mathematical Software\u00a038, 1\u201318 (2011), \n                    \n                      http:\/\/www.cise.ufl.edu\/research\/sparse\/matrices\/","journal-title":"ACM Transaction on Mathematical Software"},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1023\/B:MACH.0000033113.59016.96","volume":"56","author":"P. Drineas","year":"2004","unstructured":"Drineas, P., Frieze, A.M., Kannan, R., Vempala, S., Vinay, V.: Clustering large graphs via the singular value decomposition. Machine Learning\u00a056, 9\u201333 (2004)","journal-title":"Machine Learning"},{"key":"24_CR7","first-page":"149","volume":"42","author":"P. Eades","year":"1984","unstructured":"Eades, P.: A heuristic for graph drawing. Congressus Numerantium\u00a042, 149\u2013160 (1984)","journal-title":"Congressus Numerantium"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"T.M.J. Fruchterman","year":"1991","unstructured":"Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force directed placement. Software - Practice and Experience\u00a021, 1129\u20131164 (1991)","journal-title":"Software - Practice and Experience"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/3-540-44541-2_20","volume-title":"Graph Drawing","author":"P. Gajer","year":"2001","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)"},{"key":"24_CR10","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":"24_CR11","unstructured":"Gansner, E.R., Hu, Y., Krishnan, S.: COAST: A convex optimization approach to stress-based embedding (2013), \n                    \n                      http:\/\/arxiv.org\/abs\/1308.5218"},{"issue":"6","key":"24_CR12","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1109\/TVCG.2012.299","volume":"19","author":"E.R. Gansner","year":"2013","unstructured":"Gansner, E.R., Hu, Y., North, S.C.: A maxent-stress model for graph layout. IEEE Trans. Vis. Comput. Graph.\u00a019(6), 927\u2013940 (2013)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"24_CR13","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.\u00a03383, pp. 285\u2013295. Springer, Heidelberg (2005)"},{"key":"24_CR14","first-page":"37","volume":"10","author":"Y. Hu","year":"2005","unstructured":"Hu, Y.: Efficient and high quality force-directed graph drawing. Mathematica Journal\u00a010, 37\u201371 (2005)","journal-title":"Mathematica Journal"},{"issue":"1","key":"24_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/321992.321993","volume":"24","author":"D.B. Johnson","year":"1977","unstructured":"Johnson, D.B.: Efficient algorithms for shortest paths in sparse networks. J. ACM\u00a024(1), 1\u201313 (1977)","journal-title":"J. ACM"},{"key":"24_CR16","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"},{"issue":"3","key":"24_CR17","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1111\/j.1467-8659.2012.03090.x","volume":"31","author":"M. Khoury","year":"2012","unstructured":"Khoury, M., Hu, Y., Krishnan, S., Scheidegger, C.: Drawing large graphs by low-rank stress majorization. Computer Graphics Forum\u00a031(3), 975\u2013984 (2012)","journal-title":"Computer Graphics Forum"},{"key":"24_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-642-00219-9_19","volume-title":"Graph Drawing","author":"Y. Koren","year":"2009","unstructured":"Koren, Y., \u00c7ivril, A.: The binary stress model for graph drawing. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol.\u00a05417, pp. 193\u2013205. Springer, Heidelberg (2009)"},{"key":"24_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02289565","volume":"29","author":"J.B. Kruskal","year":"1964","unstructured":"Kruskal, J.B.: Multidimensioal scaling by optimizing goodness of fit to a nonmetric hypothesis. Psychometrika\u00a029, 1\u201327 (1964)","journal-title":"Psychometrika"},{"key":"24_CR20","unstructured":"Kruskal, J.B., Seery, J.B.: Designing network diagrams. In: Proc. First General Conference on Social Graphics, pp. 22\u201350. U. S. Department of the Census, Washington, D.C. (July 1980), Bell Laboratories Technical Report No. 49"},{"issue":"2","key":"24_CR21","doi-asserted-by":"publisher","first-page":"453","DOI":"10.7155\/jgaa.00154","volume":"11","author":"A. Noack","year":"2007","unstructured":"Noack, A.: Energy models for graph clustering. J. Graph Algorithms and Applications\u00a011(2), 453\u2013480 (2007)","journal-title":"J. Graph Algorithms and Applications"},{"key":"24_CR22","doi-asserted-by":"crossref","first-page":"026102","DOI":"10.1103\/PhysRevE.79.026102","volume":"79","author":"A. Noack","year":"2009","unstructured":"Noack, A.: Modularity clustering is force-directed layout. Physical Review E\u00a079, 026102 (2009)","journal-title":"Physical Review E"},{"issue":"1","key":"24_CR23","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0304-3975(03)00402-X","volume":"312","author":"S. Pettie","year":"2004","unstructured":"Pettie, S.: A new approach to all-pairs shortest paths on real-weighted graphs. Theoretical Computer Science\u00a0312(1), 47\u201374 (2004)","journal-title":"Theoretical Computer Science"},{"key":"24_CR24","first-page":"721","volume-title":"Advances in Neural Information Processing Systems 15","author":"V. Silva de","year":"2003","unstructured":"de Silva, V., Tenenbaum, J.B.: Global versus local methods in nonlinear dimensionality reduction. In: Advances in Neural Information Processing Systems 15, pp. 721\u2013728. MIT Press, Cambridge (2003)"},{"issue":"2","key":"24_CR25","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10107-002-0347-5","volume":"95","author":"R.H. T\u00fct\u00fcnc\u00fc","year":"2003","unstructured":"T\u00fct\u00fcnc\u00fc, R.H., Toh, K.C., Todd, M.J.: Solving semidefinite-quadratic-linear programs using SDPT3. Mathematical Programming\u00a095(2), 189\u2013217 (2003)","journal-title":"Mathematical Programming"},{"key":"24_CR26","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 and Applications\u00a07, 253\u2013285 (2003)","journal-title":"J. Graph Algorithms and Applications"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03841-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T21:50:43Z","timestamp":1558734643000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03841-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319038407","9783319038414"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03841-4_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}