{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T05:12:57Z","timestamp":1769577177408,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540245285","type":"print"},{"value":"9783540318439","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31843-9_29","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T20:54:14Z","timestamp":1278363254000},"page":"285-295","source":"Crossref","is-referenced-by-count":122,"title":["Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Hachul","sequence":"first","affiliation":[]},{"given":"Michael","family":"J\u00fcnger","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1023\/A:1008047806690","volume":"12","author":"S. Aluru","year":"1998","unstructured":"Aluru, S., et al.: Distribution-Independent Hierarchical Algorithms for the N-body Problem. Journal of Supercomputing\u00a012, 303\u2013323 (1998)","journal-title":"Journal of Supercomputing"},{"key":"29_CR2","unstructured":"The AT&T graph collection, www.graphdrawing.org"},{"issue":"4","key":"29_CR3","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1038\/324446a0","volume":"324","author":"J. Barnes","year":"1986","unstructured":"Barnes, J., Hut, P.: A hierarchical $\\mathcal{O}$ (N logN) force-calculation algorithm. Nature\u00a0324(4), 446\u2013449 (1986)","journal-title":"Nature"},{"issue":"4","key":"29_CR4","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1145\/234535.234538","volume":"15","author":"R. Davidson","year":"1996","unstructured":"Davidson, R., Harel, D.: Drawing Graphs Nicely Using Simulated Annealing. ACM Transaction on Graphics\u00a015(4), 301\u2013331 (1996)","journal-title":"ACM Transaction on Graphics"},{"key":"29_CR5","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"},{"issue":"11","key":"29_CR6","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\u2013Practice and Experience\u00a021(11), 1129\u20131164 (1991)","journal-title":"Software\u2013Practice and Experience"},{"key":"29_CR7","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., et al.: 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":"29_CR8","doi-asserted-by":"crossref","unstructured":"Greengard, L.F.: The Rapid Evaluation of Potential Fields in Particle Systems. In: ACM distinguished dissertations. The MIT Press, Cambridge (1988)","DOI":"10.7551\/mitpress\/5750.001.0001"},{"key":"29_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/3-540-44541-2_18","volume-title":"Graph Drawing","author":"D. Harel","year":"2001","unstructured":"Harel, D., Koren, Y.: A Fast Multi-scale Method for Drawing Large Graphs. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 183\u2013196. Springer, Heidelberg (2001)"},{"key":"29_CR10","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":"29_CR11","series-title":"Mathematics and Visualization","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/978-3-642-18638-7_7","volume-title":"Graph Drawing Software","author":"M. J\u00fcnger","year":"2004","unstructured":"J\u00fcnger, M., et al.: AGD - A Library of Algorithms for Graph Drawing. In: Graph Drawing Software. Mathematics and Visualization, vol.\u00a0XII, pp. 149\u2013169. Springer, Heidelberg (2004)"},{"key":"29_CR12","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":"4","key":"29_CR13","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1137\/S154034590241370X","volume":"1","author":"Y. Koren","year":"2003","unstructured":"Koren, Y., et al.: Drawing Huge Graphs by Algebraic Multigrid Optimization. Multiscale Modeling and Simulation\u00a01(4), 645\u2013673 (2003)","journal-title":"Multiscale Modeling and Simulation"},{"key":"29_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/3-540-44541-2_19","volume-title":"Graph Drawing","author":"A. Quigley","year":"2001","unstructured":"Quigley, A., Eades, P.: FADE: Graph Drawing, Clustering, and Visual Abstraction. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 197\u2013210. Springer, Heidelberg (2001)"},{"key":"29_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/3-540-37623-2_33","volume-title":"Graph Drawing","author":"D. Tunkelang","year":"1999","unstructured":"Tunkelang, D.: JIGGLE: Java Interactive Graph Layout Environment. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol.\u00a01547, pp. 413\u2013422. Springer, Heidelberg (1999)"},{"key":"29_CR16","unstructured":"C. Walshaw\u2019s graph collection, http:\/\/www.gre.ac.uk\/~c.walshaw\/partition"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Walshaw, C.: A Multilevel Algorithm for Force-Directed Graph Drawing. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 171\u2013182. Springer, Heidelberg (2001)","DOI":"10.1007\/3-540-44541-2_17"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31843-9_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:28:16Z","timestamp":1605760096000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31843-9_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245285","9783540318439"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31843-9_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}