{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:10:25Z","timestamp":1725577825951},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642184680"},{"type":"electronic","value":"9783642184697"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18469-7_8","type":"book-chapter","created":{"date-parts":[[2011,2,10]],"date-time":"2011-02-10T05:30:40Z","timestamp":1297315840000},"page":"80-91","source":"Crossref","is-referenced-by-count":16,"title":["An Experimental Evaluation of Multilevel Layout Methods"],"prefix":"10.1007","author":[{"given":"Gereon","family":"Bartel","sequence":"first","affiliation":[]},{"given":"Carsten","family":"Gutwenger","sequence":"additional","affiliation":[]},{"given":"Karsten","family":"Klein","sequence":"additional","affiliation":[]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"The Open Graph Drawing Framework, \n                    \n                      http:\/\/www.ogdf.net"},{"key":"8_CR2","unstructured":"The AT&T graph library, \n                    \n                      http:\/\/www.graphdrawing.org\n                    \n                    \n                  ."},{"key":"8_CR3","volume-title":"Graph Drawing","author":"G.D. Battista","year":"1999","unstructured":"Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice-Hall, Englewood Cliffs (1999)"},{"key":"8_CR4","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 algorithms. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol.\u00a01027, pp. 76\u201387. Springer, Heidelberg (1996)"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-00219-9_21","volume-title":"Graph Drawing","author":"U. Brandes","year":"2009","unstructured":"Brandes, U., Pich, C.: An experimental study on distance-based graph drawing. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol.\u00a05417, pp. 218\u2013229. Springer, Heidelberg (2009)"},{"issue":"4","key":"8_CR6","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 Trans. Graph.\u00a015(4), 301\u2013331 (1996)","journal-title":"ACM Trans. Graph."},{"key":"8_CR7","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":"6","key":"8_CR8","doi-asserted-by":"publisher","first-page":"1310","DOI":"10.1109\/TVCG.2007.70580","volume":"13","author":"Y. Frishman","year":"2007","unstructured":"Frishman, Y., Tal, A.: Multi-level graph layout on the GPU. IEEE Transactions on Visualization and Computer Graphics\u00a013(6), 1310\u20131319 (2007)","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"issue":"11","key":"8_CR9","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. Softw. Pract. Exper.\u00a021(11), 1129\u20131164 (1991)","journal-title":"Softw. Pract. Exper."},{"issue":"3","key":"8_CR10","doi-asserted-by":"publisher","first-page":"203","DOI":"10.7155\/jgaa.00052","volume":"6","author":"P. Gajer","year":"2002","unstructured":"Gajer, P., Kobourov, S.G.: GRIP: Graph drawing with intelligent placement. J. Graph Algorithms Appl.\u00a06(3), 203\u2013224 (2002)","journal-title":"J. Graph Algorithms Appl."},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-00219-9_10","volume-title":"Graph Drawing","author":"A. Godiyal","year":"2009","unstructured":"Godiyal, A., Hoberock, J., Garland, M., Hart, J.C.: Rapid multipole graph drawing on the GPU. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol.\u00a05417, pp. 90\u2013101. Springer, Heidelberg (2009)"},{"key":"8_CR12","unstructured":"Gronemann, M.: Engineering the fast-multipole-multilevel method for multicore and SIMD architectures. Master\u2019s thesis, Technische Universit\u00e4t Dortmund (2009)"},{"key":"8_CR13","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. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 285\u2013295. Springer, Heidelberg (2005)"},{"issue":"2","key":"8_CR14","doi-asserted-by":"publisher","first-page":"345","DOI":"10.7155\/jgaa.00150","volume":"11","author":"S. Hachul","year":"2007","unstructured":"Hachul, S., J\u00fcnger, M.: Large-graph layout algorithms at work: An experimental study. J. Graph Algorithms Appl.\u00a011(2), 345\u2013369 (2007)","journal-title":"J. Graph Algorithms Appl."},{"key":"8_CR15","unstructured":"Han, K., Ju, B.-H., Park, J.H.: InterViewer: Dynamic visualization of protein-protein interactions, \n                    \n                      http:\/\/interviewer.inha.ac.kr\/"},{"issue":"1","key":"8_CR16","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(1), 7\u201315 (1989)","journal-title":"Information Processing Letters"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","volume-title":"Drawing Graphs","year":"2001","unstructured":"Kaufmann, M., Wagner, D. (eds.): Drawing Graphs. LNCS, vol.\u00a02025. Springer, Heidelberg (2001)"},{"key":"8_CR18","unstructured":"Walshaw, C.: The graph partitioning archive, \n                    \n                      http:\/\/staffweb.cms.gre.ac.uk\/~c.walshaw\/partition\/"},{"issue":"3","key":"8_CR19","doi-asserted-by":"publisher","first-page":"253","DOI":"10.7155\/jgaa.00070","volume":"7","author":"C. Walshaw","year":"2003","unstructured":"Walshaw, C.: A multilevel algorithm for force-directed graph-drawing. J. Graph Algorithms Appl.\u00a07(3), 253\u2013285 (2003)","journal-title":"J. Graph Algorithms Appl."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18469-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T07:48:55Z","timestamp":1553413735000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18469-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642184680","9783642184697"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18469-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}