{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T10:10:07Z","timestamp":1760955007402},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540669043"},{"type":"electronic","value":"9783540466482"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46648-7_20","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T08:29:28Z","timestamp":1186907368000},"page":"197-204","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["An Algorithm for Drawing Compound Graphs"],"prefix":"10.1007","author":[{"given":"Fran\u00e7ois","family":"Bertault","sequence":"first","affiliation":[]},{"given":"Mirka","family":"Miller","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,3,3]]},"reference":[{"issue":"5","key":"20_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","volume":"4","author":"G. Battista Di","year":"1994","unstructured":"G. Di Battista, P. D. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography,. Computational Geometry: theory and applications, 4(5):235\u2013282, 1994.","journal-title":"Computational Geometry: theory and applications"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"P. D. Eades and Q.-W. Feng. Multilevel visualisation of clustered graphs. In S. North, editor, Graph drawing, volume 1190, pages 101\u2013111, Berkeley (USA), 1996. Springer Verlag.","DOI":"10.1007\/3-540-62495-3_41"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"P. D. Eades, Q.-W. Feng, and X. Lin. Straight-line drawing algorithms for hierarchical graphs and clustered graphs. In S. North, editor, Graph drawing, volume 1190, pages 113\u2013127, Berkeley (USA), 1996. Springer Verlag.","DOI":"10.1007\/3-540-62495-3_42"},{"issue":"11","key":"20_CR4","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. Software-Practice and Experience, 21(11):1129\u20131164, 1991.","journal-title":"Software-Practice and Experience"},{"issue":"5","key":"20_CR5","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/42411.42414","volume":"31","author":"D. Harel","year":"1988","unstructured":"D. Harel. On visual formalisms. Communications of the ACM, 31(5):514\u2013530, 1988.","journal-title":"Communications of the ACM"},{"key":"20_CR6","unstructured":"S. C. North. Drawing ranked digraphs with recursive clusters. ALCOM Workshop on Graph Drawing 93, 1993."},{"issue":"2","key":"20_CR7","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1109\/TSE.1981.234519","volume":"SE-7","author":"E. M. Reingold","year":"1981","unstructured":"E. M. Reingold and J. S. Tilford. Tidier drawings of trees. IEEE Transactions on Software Engineering, SE-7(2):223\u2013228, March 1981.","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"21","key":"20_CR8","first-page":"876","volume":"4","author":"K. Sugiyama","year":"1991","unstructured":"K. Sugiyama and K. Misue. Visualisation of structural information: automatic drawing of compound digraphs. IEEE Trans. SMC, 4(21):876\u2013893, 1991.","journal-title":"IEEE Trans. SMC"},{"key":"20_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/BFb0021834","volume-title":"Graph Drawing","author":"K. Sugiyama","year":"1995","unstructured":"K. Sugiyama and K. Misue. A generic compound graph visualizer\/manipulator: D-Abductor. In F. J. Brandenburg, editor, Graph Drawing, volume 1027 of Lecture Notes in Computer Science, pages 500\u2013503, Passau (Allemagne), 1995. Springer Verlag."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46648-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T17:15:19Z","timestamp":1585934119000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46648-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540669043","9783540466482"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-46648-7_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"3 March 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}