{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T10:10:39Z","timestamp":1760955039713},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540654735"},{"type":"electronic","value":"9783540376231"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-37623-2_28","type":"book-chapter","created":{"date-parts":[[2007,11,19]],"date-time":"2007-11-19T12:45:17Z","timestamp":1195476317000},"page":"364-373","source":"Crossref","is-referenced-by-count":50,"title":["Improved Force-Directed Layouts"],"prefix":"10.1007","author":[{"given":"Emden R.","family":"Gansner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen C.","family":"North","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,1,15]]},"reference":[{"key":"28_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BFb0054318","volume-title":"LATIN\u201998: Theoretical Informatics","author":"J. Abello","year":"1998","unstructured":"J. Abello and E. Gansner. Short and smooth polygonal paths. In C. Lucchesi and A. Moura, editors, LATIN\u201998: Theoretical Informatics, volume 1380 of Lecture Notes in Computer Science, pages 151\u2013162, 1998."},{"key":"28_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/BFb0021792","volume-title":"Symposium on Graph Drawing GD\u201995","author":"F.J. Brandenburg","year":"1996","unstructured":"F.J. Brandenburg, M. Himsolt, and C. Rohrer. An experimental comparison of force-directed and randomized graph drawing algorithms. In F.J. Brandenburg, editor, Symposium on Graph Drawing GD\u201995, volume 1027 of Lecture Notes in Computer Science, pages 76\u201387, 1996."},{"issue":"11","key":"28_CR3","first-page":"197","volume":"4","author":"J. Cohen","year":"1987","unstructured":"J. Cohen. Drawing graphs to convey proximity: an incremental arrangement method. ACM Transactions on Computer-Human Interaction, 4(11):197\u2013229, 1987.","journal-title":"ACM Transactions on Computer-Human Interaction"},{"issue":"4","key":"28_CR4","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1145\/234535.234538","volume":"15","author":"R. Davidson","year":"1996","unstructured":"R. Davidson and D. Harel. Drawing graphs nicely using simulated annealing. ACM Transactions on Graphics, 15(4):301\u2013331, 1996.","journal-title":"ACM Transactions on Graphics"},{"key":"28_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/3-540-63938-1_68","volume-title":"Symposium on Graph Drawing GD\u201997","author":"D. Dobkin","year":"1997","unstructured":"D. Dobkin, E. Gansner, E. Koutsofios, and S. North. Implementing a general-purpose edge router. In G. DiBattista, editor, Symposium on Graph Drawing GD\u201997, volume 1353 of Lecture Notes in Computer Science, pages 262\u2013271, 1997."},{"key":"28_CR6","first-page":"149","volume":"42","author":"P. Eades","year":"1984","unstructured":"P. Eades. A heuristic for graph drawing. Congressus Numerantium, 42:149\u2013160, 1984.","journal-title":"Congressus Numerantium"},{"key":"28_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1007\/BFb0045087","volume-title":"COCOON\u201997","author":"P. Eades","year":"1997","unstructured":"P. Eades and X. Lin. Spring algorithms and symmetry. In COCOON\u201997, volume 1276 of Lecture Notes in Computer Science, pages 202\u2013211, 1997."},{"key":"28_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1007\/BFb0021809","volume-title":"Symposium on Graph Drawing GD\u201995","author":"U. Fossmeier","year":"1996","unstructured":"U. Fossmeier and M. Kaufmann. Drawing high degree graphs with low bend numbers. In F.J. Brandenburg, editor, Symposium on Graph Drawing GD\u201995, volume 1027 of Lecture Notes in Computer Science, pages 254\u2013266, 1996."},{"key":"28_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1007\/3-540-58950-3_393","volume-title":"Symposium on Graph Drawing GD\u201994","author":"A. Frick","year":"1995","unstructured":"A. Frick, A. Ludwig, and H. Mehldau. A fast adaptive layout algorithm for undirected graphs. In R. Tamassia and I.G. Tollis, editors, Symposium on Graph Drawing GD\u201994, volume 894 of Lecture Notes in Computer Science, pages 388\u2013403, 1995."},{"issue":"11","key":"28_CR10","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"T. Fruchterman","year":"1991","unstructured":"T. Fruchterman and E. Reingold. Graph drawing by force-directed placement. Software-Practice and Experience, 21(11):1129\u20131164, 1991. also as Technical Report UIUCDCS-R-90-1609, Dept. of Computer Science,Univ. of Illinois at Urbana-Champaign, 1990.","journal-title":"Software-Practice and Experience"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"E.R. Gansner, E. Koutsofios, S.C. North, and K.P. Vo. A technique for drawing directed graphs. IEEE Transactions on Software Engineering, March 1993.","DOI":"10.1109\/32.221135"},{"issue":"11","key":"28_CR12","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1002\/spe.4380181104","volume":"18","author":"E.R. Gansner","year":"1988","unstructured":"E.R. Gansner, S.C. North, and K.P. Vo. Dag-a program that draws directed graphs. Software-Practice and Experience, 18(11):1047\u20131062, 1988.","journal-title":"Software-Practice and Experience"},{"key":"28_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/3-540-62495-3_50","volume-title":"Symposium on Graph Drawing GD\u201996","author":"W. He","year":"1997","unstructured":"W. He and K. Marriott. Constrained graph layout. In S.C. North, editor, Symposium on Graph Drawing GD\u201996, volume 1190 of Lecture Notes in Computer Science, pages 217\u2013232, 1997."},{"key":"28_CR14","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0020-0190(89)90102-6","volume":"31","author":"T. Kamada","year":"1989","unstructured":"T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Information Processing Letters, 31:7\u201315, 1989.","journal-title":"Information Processing Letters"},{"key":"28_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BFb0021818","volume-title":"Symposium on Graph Drawing GD\u201995","author":"T. Kamps","year":"1996","unstructured":"T. Kamps, J. Kleinz, and J. Read. Constraint-based spring-model algorithm for graph layout. In F.J. Brandenburg, editor, Symposium on Graph Drawing GD\u201995, volume 1027 of Lecture Notes in Computer Science, pages 349\u2013360, 1996."},{"key":"28_CR16","first-page":"300","volume-title":"Practical Reusable UNIX Software","author":"E. Koutsofios","year":"1995","unstructured":"E. Koutsofios and S. North. Intertool connections. In B. Krishnamurthy, editor, Practical Reusable UNIX Software, chapter 11, pages 300\u2013315. John Wiley & Sons, New York, 1995."},{"key":"28_CR17","unstructured":"J. Kruskal and J. Seery. Designing network diagrams. In Proc. First General Conf. on Social Graphics, pages 22\u201350, 1980."},{"key":"28_CR18","unstructured":"X. Lin. Analysis of Algorithms for Drawing Graphs. PhD thesis, Department of Computer Science, University of Queensland, 1992."},{"key":"28_CR19","doi-asserted-by":"crossref","unstructured":"R. Lipton, S. North, and J. Sandberg. A method for drawing graphs. In Proc. ACM Symp. on Computational Geometry, pages 153\u2013160, 1985.","DOI":"10.1145\/323233.323254"},{"key":"28_CR20","unstructured":"K. Lyons. Cluster busting in anchored graph drawing. In Proceedings of the 1992 CAS Conference, pages 7\u201316, 1992."},{"issue":"1","key":"28_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00004","volume":"2","author":"K. Lyons","year":"1998","unstructured":"K. Lyons, H. Meijer, and D. Rappaport. Algorithms for cluster busting in anchored graph drawing. Journal of Graph Algorithms and Applications, 2(1):1\u201324, 1998.","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"28_CR22","volume-title":"Computational Geometry in C","author":"O\u2019Rourke","year":"1994","unstructured":"O\u2019Rourke. Computational Geometry in C. Cambridge University Press, Cambridge, 1994."},{"key":"28_CR23","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/BFb0021833","volume-title":"Symposium on Graph Drawing GD\u201995","author":"M.-A. Storey","year":"1996","unstructured":"M.-A. Storey and H. Muller. Graph layout adjustment strategies. In F.J. Brandenburg, editor, Symposium on Graph Drawing GD\u201995, volume 1027 of Lecture Notes in Computer Science, pages 487\u201399, 1996."},{"key":"28_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1007\/3-540-58950-3_391","volume-title":"Symposium on Graph Drawing GD\u201994","author":"K. Sugiyama","year":"1995","unstructured":"K. Sugiyama and K. Misue. A simple and unified method for drawing graphs: Magnetic-spring algorithm. In R. Tamassia and I.G. Tollis, editors, Symposium on Graph Drawing GD\u201994, volume 894 of Lecture Notes in Computer Science, pages 364\u2013375, 1995."},{"issue":"2","key":"28_CR25","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"SMC-11","author":"K. Sugiyama","year":"1981","unstructured":"K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical systems. IEEE Transactions on Systems, Man and Cybernetics, SMC-11(2):109\u2013125, 1981.","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"issue":"3","key":"28_CR26","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R. Tamassia","year":"1987","unstructured":"R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Computing, 16(3):421\u2013444, 1987.","journal-title":"SIAM J. Computing"},{"issue":"1","key":"28_CR27","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/21.87055","volume":"SMC-18","author":"R. Tamassia","year":"1988","unstructured":"R. Tamassia, G. Di Battista, and C. Batini. Automatic graph drawing and readability of diagrams. IEEE Transactions on Systems, Man and Cybernetics, SMC-18(1):61\u201379, 1988.","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"28_CR28","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/BFb0021835","volume-title":"Symposium on Graph Drawing GD\u201995","author":"X. Wang","year":"1996","unstructured":"X. Wang and I. Miyamoto. Generating customized layouts. In F.J. Brandenburg, editor, Symposium on Graph Drawing GD\u201995, volume 1027 of Lecture Notes in Computer Science, pages 504\u2013515, 1996."},{"key":"28_CR29","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/3-540-63938-1_85","volume-title":"Symposium on Graph Drawing GD\u201997","author":"G. Wills","year":"1997","unstructured":"G. Wills. Nicheworks-interactive visualization of very large graphs. In G. Di-Battista, editor, Symposium on Graph Drawing GD\u201997, volume 1353 of Lecture Notes in Computer Science, pages 403\u2013414, 1997."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-37623-2_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T19:21:42Z","timestamp":1551122502000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-37623-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540654735","9783540376231"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-37623-2_28","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}