{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T03:57:13Z","timestamp":1769572633493,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540314257","type":"print"},{"value":"9783540316671","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11618058_22","type":"book-chapter","created":{"date-parts":[[2006,1,20]],"date-time":"2006-01-20T09:56:50Z","timestamp":1137751010000},"page":"235-250","source":"Crossref","is-referenced-by-count":46,"title":["An Experimental Comparison of Fast Algorithms for Drawing General Large Graphs"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Hachul","sequence":"first","affiliation":[]},{"given":"Michael","family":"J\u00fcnger","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","unstructured":"The AT&T graph collection, \n                    \n                      www.graphdrawing.org"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/BFb0021792","volume-title":"Graph Drawing","author":"F.J. Brandenburg","year":"1996","unstructured":"Brandenburg, F.J., Himsolt, M., Rohrer, C.: An Experimental Comparison of Force-Directed and Randomized Graph Drawing Methods. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol.\u00a01027, pp. 76\u201387. Springer, Heidelberg (1996)"},{"key":"22_CR3","series-title":"Mathematics and Visualization","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/978-3-642-18638-7_15","volume-title":"Graph Drawing Software","author":"U. Brandes","year":"2004","unstructured":"Brandes, U., Wagner, D.: Visone - Analysis and Visualization of Social Networks. In: Graph Drawing Software. Mathematics and Visualization, vol.\u00a0XII, pp. 321\u2013340. Springer, Heidelberg (2004)"},{"issue":"4","key":"22_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 Transactions on Graphics\u00a015(4), 301\u2013331 (1996)","journal-title":"ACM Transactions on Graphics"},{"key":"22_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"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1007\/3-540-58950-3_393","volume-title":"Graph Drawing","author":"A. Frick","year":"1995","unstructured":"Frick, A., Ludwig, A., Mehldau, H.: A Fast Adaptive Layout Algorithm for Undirected Graphs. In: Tamassia, R., Tollis, I.G. (eds.) GD 1994. LNCS, vol.\u00a0894, pp. 388\u2013403. Springer, Heidelberg (1995)"},{"issue":"11","key":"22_CR7","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":"22_CR8","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":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-44541-2_21","volume-title":"Graph Drawing","author":"P. Gajer","year":"2001","unstructured":"Gajer, P., Kobourov, S.G.: GRIP: Graph Drawing with Intelligent Placement. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 222\u2013228. Springer, Heidelberg (2001)"},{"key":"22_CR10","unstructured":"Hachul, S.: A Potential-Field-Based Multilevel Algorithm for Drawing Large Graphs. PhD thesis, Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln, Germany (2005)"},{"key":"22_CR11","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 (Extended Abstract). In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 285\u2013295. Springer, Heidelberg (2005)"},{"key":"22_CR12","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":"22_CR13","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":"22_CR14","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., Klau, G.W., Mutzel, P., Weiskircher, R.: AGD - A Library of Algorithms for Graph Drawing. In: J\u00fcnger, M., Mutzel, P. (eds.) Graph Drawing Software. Mathematics and Visualization, vol.\u00a0XII, pp. 149\u2013172. Springer, Heidelberg (2004)"},{"key":"22_CR15","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":"22_CR16","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1137\/S154034590241370X","volume":"1","author":"Y. Koren","year":"2003","unstructured":"Koren, Y., Carmel, L., Harel, D.: Drawing Huge Graphs by Algebraic Multigrid Optimization. Multiscale Modeling and Simulation\u00a01(4), 645\u2013673 (2003)","journal-title":"Multiscale Modeling and Simulation"},{"key":"22_CR17","unstructured":"Y. Koren\u2019s algorithms, \n                    \n                      research.att.com\/~yehuda\/index_programs.html"},{"key":"22_CR18","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":"22_CR19","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":"22_CR20","unstructured":"Walshaw\u2019s, C.: Graph collection, \n                    \n                      staffweb.cms.gre.ac.uk\/~c.walshaw\/partition"},{"key":"22_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/3-540-44541-2_17","volume-title":"Graph Drawing","author":"C. Walshaw","year":"2001","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)"},{"key":"22_CR22","unstructured":"Yusufov\u2019s, R.: Implementation of GRIP, \n                    \n                      www.cs.arizona.edu\/~kobourov\/GRIP"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11618058_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:12:12Z","timestamp":1619507532000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11618058_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540314257","9783540316671"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11618058_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}