{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T03:54:22Z","timestamp":1769572462588,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"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_18","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T12:01:32Z","timestamp":1184587292000},"page":"183-196","source":"Crossref","is-referenced-by-count":63,"title":["A Fast Multi-scale Method for Drawing Large Graphs"],"prefix":"10.1007","author":[{"given":"David","family":"Harel","sequence":"first","affiliation":[]},{"given":"Yehuda","family":"Koren","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,5,27]]},"reference":[{"key":"18_CR1","series-title":"Lect Notes Comput Sci","first-page":"76","volume-title":"An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms","author":"F.J. Brandenburg","year":"1995","unstructured":"Brandenburg, F.J., Himsolt, M., and Rohrer, C., \u201cAn Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms\u201d, Proceedings of Graph Drawing\u2019 95, Lecture Notes in Computer Science, Vol. 1027, pp. 76\u201387, Springer Verlag, 1995."},{"key":"18_CR2","unstructured":"Di Battista, G., Eades, P., Tamassia, R. and Tollis, I.G., Algorithms for the Visualization of Graphs, Prentice-Hall, 1999."},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1145\/234535.234538","volume":"15","author":"R. Davidson","year":"1996","unstructured":"Davidson, R., and Harel, D., \u201cDrawing Graphs Nicely Using Simulated Annealing\u201d, ACM Trans. on Graphics\n                           15 (1996), 301\u2013331.","journal-title":"ACM Trans. on Graphics"},{"key":"18_CR4","first-page":"149","volume":"42","author":"P. Eades","year":"1984","unstructured":"Eades, P., \u201cA Heuristic for Graph Drawing\u201d, Congressus Numerantium\n                           42 (1984), 149\u2013160.","journal-title":"Congressus Numerantium"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"T.M.G. Fruchterman","year":"1991","unstructured":"Fruchterman, T.M.G., and Reingold, E., \u201cGraph Drawing by Force-Directed Placement\u201d, Software-Practice and Experience\n                           21 (1991), 1129\u20131164.","journal-title":"Software-Practice and Experience"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"T. Gonzalez","year":"1985","unstructured":"Gonzalez, T., \u201cClustering to Minimize the Maximum Inter-Cluster Distance\u201d, Theoretical Computer Science\n                           38 (1985), 293\u2013306.","journal-title":"Theoretical Computer Science"},{"key":"18_CR7","series-title":"Lect Notes Comput Sci","volume-title":"Discrete Applied Mathematics","author":"R. Hadany","year":"2000","unstructured":"Hadany, R., and Harel, D., \u201cA Multi-Scale Method for Drawing Graphs Nicely\u201d, Discrete Applied Mathematics, in press, 2000. (Also, Proc. 25th Inter. Workshop on Graph-Theoretic Concepts in Computer Science (WG\u2019 99), Lecture Notes in Computer Science, Vol. 1665, pp. 262-277, Springer Verlag, 1999.)"},{"key":"18_CR8","unstructured":"Hochbaum, D. S. (ed.), Approximation Algorithms for NP-Hard Problems, PWS Publishing Company, 1996."},{"key":"18_CR9","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1145\/5925.5933","volume":"33","author":"D.S. Hochbaum","year":"1986","unstructured":"Hochbaum, D.S., and Shmoys, D. B, \u201cA Unified Approach to Approximation Algorithms for Bottleneck Problems\u201d, J. Assoc. Comput. Mach.\n                           33 (1986), 533\u2013550.","journal-title":"J. Assoc. Comput. Mach."},{"key":"18_CR10","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., and Kawai, S., \u201cAn Algorithm for Drawing General Undirected Graphs\u201d, Information Processing Letters\n                           31 (1989), 7\u201315.","journal-title":"Information Processing Letters"}],"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_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T18:29:51Z","timestamp":1550428191000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44541-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540415541","9783540445418"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-44541-2_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}