{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T14:00:20Z","timestamp":1726495220759},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540415541"},{"type":"electronic","value":"9783540445418"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44541-2_20","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:01:32Z","timestamp":1184601692000},"page":"211-221","source":"Crossref","is-referenced-by-count":30,"title":["A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs"],"prefix":"10.1007","author":[{"given":"Pawel","family":"Gajer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael T.","family":"Goodrich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen G.","family":"Kobourov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,5,27]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/0010-4655(91)90151-A","volume":"65","author":"A. Brandt","year":"1991","unstructured":"A. Brandt. Multilevel computations of integral transforms and particle interactions with oscillatory kernels. Computer Physics Communications, 65:24\u201338, 1991.","journal-title":"Computer Physics Communications"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0920-5632(92)90234-J","volume":"26","author":"A. Brandt","year":"1992","unstructured":"A. Brandt. Multigrid methods in lattice field computations. Nucl. Phys. B, 26:137\u2013180, 1992. Proc. Suppl.","journal-title":"Nucl. Phys. B"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"I. Bru\u00df and A. Frick. Fast interactive 3-D graph visualization. In Graph Drawing (Proc. GD\u2019 95), pages 99\u2013110, 1995.","DOI":"10.1007\/BFb0021794"},{"issue":"4","key":"20_CR4","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 graphics nicely using simulated annealing. ACM Trans. Graph., 15(4):301\u2013331, 1996.","journal-title":"ACM Trans. Graph."},{"key":"20_CR5","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","volume":"4","author":"G. Battista Di","year":"1994","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Computational Geometry: Theory and Applications, 4:235\u2013282, 1994.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"20_CR6","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G. Battista Di","year":"1999","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, Englewood Cliffs, NJ, 1999."},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"C. A. Duncan, M. T. Goodrich, and S. G. Kobourov. Balanced aspect ratio trees and their use for drawing very large graphs. In Proceedings of the 6th Symposium on Graph Drawing, pages 111\u2013124, 1998.","DOI":"10.1007\/3-540-37623-2_9"},{"key":"20_CR8","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":"20_CR9","doi-asserted-by":"crossref","unstructured":"P. Eades and Q. Feng. Multilevel visualization of clustered graphs. In Proceedings of the 4th Symposium on Graph Drawing (GD\u2019 96), pages 101\u2013112, 1996.","DOI":"10.1007\/3-540-62495-3_41"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"P. Eades, Q. Feng, and X. Lin. Straight-line drawing algorithms for hierarchical graphs and clustered graphs. In Proceedings of the 4th Symposium on Graph Drawing (GD\u2019 96), pages 113\u2013128, 1996.","DOI":"10.1007\/3-540-62495-3_42"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Q. Feng, R. F. Cohen, and P. Eades. How to draw a planar clustered graph. In Procs. of the 1st Annual International Conference on Computing and Combinatorics (COCOON\u2019 95), pages 21\u201331, 1995.","DOI":"10.1007\/BFb0030816"},{"key":"20_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1007\/3-540-58950-3_393","volume-title":"A fast adaptive layout algorithm for undirected graphs","author":"A. Frick","year":"1995","unstructured":"A. Frick, A. Ludwig, and H. Mehldau. A fast adaptive layout algorithm for undirected graphs. In R. Tamassia and I. G. Tollis, editors, Graph Drawing (Proc. GD\u2019 94), LNCS 894, pages 388\u2013403, 1995."},{"issue":"11","key":"20_CR13","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"T. Fruchterman","year":"1991","unstructured":"T. Fruchterman and E. Reingold. Graph drawing by force-directed placement. Softw.-Pract. Exp., 21(11):1129\u20131164, 1991.","journal-title":"Softw.-Pract. Exp."},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"G. W. Furnas. Generalized fisheye views. In Proceedings of ACM Conference on Human Factors in Computing Systems (CHI\u2019 86), pages 16\u201323, 1986.","DOI":"10.1145\/22627.22342"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"P. Gajer and S. G. Kobourov. GRIP: Graph dRawing with Intelligent Placement. In To appear in Proceedings of the 8th Symposium on Graph Drawing, 2000.","DOI":"10.1007\/3-540-44541-2_21"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"R. Hadany and D. Harel. A multi-scale algorithm for drawing graphs nicely. In Proc. 25th International Workshop on Graph Teoretic Concepts in Computer Science (WG\u201999), 1999.","DOI":"10.1007\/3-540-46784-X_26"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"D. Harel and Y. Koren. A fast multi-scale method for drawing large graphs. Technical Report MCS99-21, The Weizmann Institute of Science, Rehovot, Israel, 1999.","DOI":"10.1145\/345513.345353"},{"key":"20_CR18","unstructured":"T. Kamada and S. Kawai. Automatic display of network structures for human understanding. Technical Report 88-007, Department of Information Science, University of Tokyo, 1988."},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"K. Kaugars, J. Reinfelds, and A. Brazma. A simple algorithm for drawing large graphs on small screens. In Graph Drawing (GD\u2019 94), pages 278\u2013281, 1995.","DOI":"10.1007\/3-540-58950-3_382"},{"key":"20_CR20","unstructured":"S. C. North. Drawing ranked digraphs with recursive clusters. In Graph Drawing 93, Proceedings of the First International Workshop on Graph Drawing, Sept. 1993."},{"issue":"6","key":"20_CR21","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1109\/TCS.1979.1084652","volume":"CAS-26","author":"N. Quinn","year":"1979","unstructured":"N. Quinn and M. Breur. A force directed component placement procedure for printed circuit boards. IEEE Transactions on Circuits and Systems, CAS-26(6):377\u2013388, 1979.","journal-title":"IEEE Transactions on Circuits and Systems"},{"issue":"12","key":"20_CR22","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/198366.198384","volume":"37","author":"M. Sarkar","year":"1994","unstructured":"M. Sarkar and M. H. Brown. Graphical fisheye views. Communications of the ACM, 37(12):73\u201384, 1994.","journal-title":"Communications of the ACM"},{"issue":"4","key":"20_CR23","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1109\/21.108304","volume":"21","author":"K. Sugiyama","year":"1991","unstructured":"K. Sugiyama and K. Misue. Visualization of structural information: Automatic drawing of compound digraphs. IEEE Transactions on Systems, Man, and Cybernetics, 21(4):876\u2013892, 1991.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"}],"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_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T03:19:32Z","timestamp":1556680772000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44541-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540415541","9783540445418"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-44541-2_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}