{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T14:10:03Z","timestamp":1737555003214,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001584"},{"type":"electronic","value":"9783540361510"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36151-0_40","type":"book-chapter","created":{"date-parts":[[2007,11,16]],"date-time":"2007-11-16T17:14:14Z","timestamp":1195233254000},"page":"374-375","source":"Crossref","is-referenced-by-count":0,"title":["Demonstration of a Preprocessor for the Spring Embedder"],"prefix":"10.1007","author":[{"given":"Paul","family":"Mutton","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Rodgers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"key":"40_CR1","first-page":"149","volume":"42","author":"P. Eades","year":"1984","unstructured":"P. Eades. A Heuristic for Graph Drawing. Congressus Numerantium 42. pp. 149\u201360. 1984.","journal-title":"Congressus Numerantium"},{"key":"40_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1007\/3-540-58950-3_393","volume-title":"GD\u201994","author":"A. Frick","year":"1995","unstructured":"A. Frick, A. Ludwig, H. Mehldau. A Fast Adaptive Layout Algorithm for Undirected Graphs. GD\u201994, LNCS 894. pp. 388\u2013403. 1995."},{"issue":"11","key":"40_CR3","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"T.M.J. Fruchterman","year":"1991","unstructured":"T.M.J. Fruchterman, E.M. Reingold. Graph Drawing by Force-directed Placement. Software-Practice and Experience, Vol. 21(11). pp. 1129\u20131164. 1991.","journal-title":"Software-Practice and Experience"},{"key":"40_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/3-540-44541-2_20","volume-title":"GD 2000","author":"P. Gajer","year":"2001","unstructured":"P. Gajer, M.T. Goodrich, S.G. Kobourov. A Fast Multi-Dimensional Algorithm for Drawing Large Graphs. GD 2000, LNCS 1984. pp. 211\u2013221. 2001"},{"doi-asserted-by":"crossref","unstructured":"P.J. Mutton, P.J. Rodgers. Spring Embedder Preprocessing forWWWVisualization. Proceedings of 6th International Conference on Information Visualization, IV02-WGV. pp. 744\u2013749. 2002.","key":"40_CR5","DOI":"10.1109\/IV.2002.1028861"},{"unstructured":"A.J. Quigley, Large Scale Relational Information Visualization, Clustering, and Abstraction, PhD Thesis, University of Newcastle, Australia. August 2001.","key":"40_CR6"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36151-0_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T13:36:38Z","timestamp":1737552998000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36151-0_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001584","9783540361510"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-36151-0_40","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}