{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T05:30:59Z","timestamp":1775799059414,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540415541","type":"print"},{"value":"9783540445418","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44541-2_17","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T12:01:32Z","timestamp":1184587292000},"page":"171-182","source":"Crossref","is-referenced-by-count":74,"title":["A Multilevel Algorithm for Force-Directed Graph Drawing"],"prefix":"10.1007","author":[{"given":"C.","family":"Walshaw","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,5,27]]},"reference":[{"issue":"4","key":"17_CR1","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 Trans. Graphics, 15(4):301\u2013331, 1996.","journal-title":"ACM Trans. Graphics"},{"key":"17_CR2","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G. Battista Di","year":"1998","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, New Jersey, U.S.A., 1998."},{"key":"17_CR3","series-title":"Lect Notes Comput Sci","volume-title":"Planarity-Preserving Clustering and Embedding for Large Planar Graphs","author":"C. A. Duncan","year":"1999","unstructured":"C. A. Duncan, M. T. Goodrich, and S. G. Kobourov. Planarity-Preserving Clustering and Embedding for Large Planar Graphs. In J. Kratochv\u00ed, editor, Proc. 7th Int. Symp. Graph Drawing, volume 1731 of LNCS. Springer, 1999."},{"key":"17_CR4","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":"17_CR5","series-title":"Lect Notes Comput Sci","first-page":"101","volume-title":"Multilevel Visualization of Clustered Graphs","author":"P. Eades","year":"1996","unstructured":"P. Eades and Q. Feng. Multilevel Visualization of Clustered Graphs. In Proc. 6th Int. Symp. Graph Drawing, volume 1190 of LNCS, pages 101\u2013112. Springer, 1996."},{"key":"17_CR6","unstructured":"P. Eades, Q. Feng, X. Lin, and H. Nagamochi. Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. Tech. rep. 98\u201303, Dept. Comp. Sci., Univ. Newcastle, Callaghan 2308, Australia, 1998."},{"issue":"11","key":"17_CR7","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"T. M. J. Fruchterman","year":"1991","unstructured":"T. M. J. Fruchterman and E. M. Reingold. Graph Drawing by Force-Directed Placement. Software-Practice & Experience, 21(11):1129\u20131164, 1991.","journal-title":"Software-Practice & Experience"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"R. Hadany and D. Harel. A Multi-Scale Algorithm for Drawing Graphs Nicely. Tech. Rep. CS99\u201301, Weizmann Inst. Sci., Faculty Maths. Comp. Sci., Jan, 1999.","DOI":"10.1007\/3-540-46784-X_26"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"D. Harel and Y. Koren. A Fast Multi-Scale Algorithm for Drawing Large Graphs. Tech. Rep. CS99\u201321, Weizmann Inst. Sci., Faculty Maths. Comp. Sci., Nov, 1999.","DOI":"10.1145\/345513.345353"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"B. Hendrickson and R. Leland. A Multilevel Algorithm for Partitioning Graphs. In S. Karin, editor, Proc. Supercomputing\u2019 95. ACM Press, 1995.","DOI":"10.1145\/224170.224228"},{"key":"17_CR11","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C. H. Papadimitriou","year":"1982","unstructured":"C. H. Papadimitriou and K. Stieglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice Hall, Englewood Cliffs, NJ, 1982."},{"key":"17_CR12","series-title":"Lect Notes Comput Sci","first-page":"395","volume-title":"Automatic Graph Clustering","author":"R. Sablowski","year":"1996","unstructured":"R. Sablowski and A. Frick. Automatic Graph Clustering. In Proc. 6th Int. Symp. Graph Drawing, volume 1190 of LNCS, pages 395\u2013400. Springer, 1996."},{"key":"17_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/3-540-37623-2_33","volume-title":"JIGGLE: Java Interactive General Graph Layout Environment","author":"D. Tunkelang","year":"1998","unstructured":"D. Tunkelang. JIGGLE: Java Interactive General Graph Layout Environment. In S. H. Whitesides, editor, Proc. 6th Int. Symp. Graph Drawing, volume 1547 of LNCS, pages 413\u2013422. Springer, 1998."},{"key":"17_CR14","unstructured":"C. Walshaw. A Multilevel Algorithm for Force-Directed Graph Drawing. Tech. Rep. 00\/IM\/60, Univ. Greenwich, London SE10 9LS, UK, April 2000."},{"key":"17_CR15","unstructured":"C. Walshaw. A Multilevel Approach to the Travelling Salesman Problem. Tech. Rep. 00\/IM\/63, Univ. Greenwich, London SE10 9LS, UK, Aug. 2000."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44541-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T06:30:14Z","timestamp":1683959414000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44541-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540415541","9783540445418"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-44541-2_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}