{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:33:58Z","timestamp":1725489238088},"publisher-location":"Berlin, Heidelberg","reference-count":12,"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_19","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T08:29:28Z","timestamp":1186907368000},"page":"186-196","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Planarity-Preserving Clustering and Embedding for Large Planar Graphs"],"prefix":"10.1007","author":[{"given":"Christian A.","family":"Duncan","sequence":"first","affiliation":[]},{"given":"Michael T.","family":"Goodrich","sequence":"additional","affiliation":[]},{"given":"Stephen G.","family":"Kobourov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,3,3]]},"reference":[{"key":"19_CR1","series-title":"Lect Notes Comput Sci","first-page":"101","volume-title":"Proc. of 6th Symposium on Graph Drawing (GD\u201998)","author":"C. A. Duncan","year":"1998","unstructured":"C. A. Duncan, M. T. Goodrich, and S. G. Kobourov. Balanced aspect ratio trees and their use for drawing very large graphs. Proc. of 6th Symposium on Graph Drawing (GD\u201998), LNCS 1190:101\u2013112, 1998."},{"key":"19_CR2","series-title":"Lect Notes Comput Sci","first-page":"101","volume-title":"Proc. of 4th Symposium on Graph Drawing (GD\u201996)","author":"P. Eades","year":"1996","unstructured":"P. Eades and Q. W. Feng. Multilevel visualization of clustered graphs. Proc. of 4th Symposium on Graph Drawing (GD\u201996), LNCS 1190:101\u2013112, 1996."},{"key":"19_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/3-540-62495-3_42","volume-title":"Proc. of the 4th Symposium on Graph Drawing (GD\u201996)","author":"P. Eades","year":"1997","unstructured":"P. Eades, Q. W. Feng, and X. Lin. Straight-line drawing algorithms for hierarchical graphs and clustered graphs. Proc. of the 4th Symposium on Graph Drawing (GD\u201996), LNCS 1190:113\u2013128, 1997."},{"key":"19_CR4","first-page":"229","volume":"11","author":"I. Fary","year":"1948","unstructured":"I. Fary. On straight lines representation of planar graphs. Acta Sci. Math. Szeged, 11:229\u2013233, 1948.","journal-title":"Acta Sci. Math. Szeged"},{"key":"19_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/3-540-60313-1_145","volume-title":"ESA\u201995","author":"Q.-W. Feng","year":"1995","unstructured":"Q.-W. Feng, R. F. Cohen, and P. Eades. Planarity for clustered graphs. ESA\u201995, LNCS 979:213\u2013226, 1995."},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R. J. Lipton","year":"1979","unstructured":"R. J. Lipton and R. E. Tarjan. A separator theorem for planar graphs. SIAM J. Appl. Math., 36:177\u2013189, 1979.","journal-title":"SIAM J. Appl. Math."},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"F. J. Newbery. Edge concentration: A method for clustering directed graphs. In Proceedings of the 2nd International Workshop on Software Configuration Management, pages 76\u201385, Princeton, New Jersey, October 1989.","DOI":"10.1145\/72910.73350"},{"key":"19_CR8","unstructured":"S. C. North. Drawing ranked digraphs with recursive clusters. ALCOM International Workshop PARIS 1993 on Graph Drawing and Topological Graph Algorithms (GD\u201993), September 1993."},{"key":"19_CR9","series-title":"Lect Notes Comput Sci","first-page":"395","volume-title":"Proc. of 4th Symposium on Graph Drawing (GD\u201996)","author":"Sablowski","year":"1996","unstructured":"Sablowski and Frick. Automatic graph clustering. Proc. of 4th Symposium on Graph Drawing (GD\u201996), LNCS 1190:395\u2013400, 1996."},{"key":"19_CR10","unstructured":"W. Schnyder. Embedding planar graphs on the grid. In Proc. 1st ACM-SIAM Sympos. Discrete Algorithms, pages 138\u2013148, 1990."},{"issue":"4","key":"19_CR11","first-page":"876","volume":"21","author":"K. Sugiyama","year":"1991","unstructured":"K. Sugiyama and K. Misue. Visualization of structural information: Automatic drawing of compound digraphs. IEEE Trans. Softw. Eng., 21(4):876\u2013892, 1991.","journal-title":"IEEE Trans. Softw. Eng."},{"key":"19_CR12","first-page":"26","volume":"46","author":"K. Wagner","year":"1936","unstructured":"K. Wagner. Bemerkungen zum vierfarbenproblem. Jahresbericht der Deutschen Mathematiker-Vereinigung, 46:26\u201332, 1936.","journal-title":"Jahresbericht der Deutschen Mathematiker-Vereinigung"}],"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_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T17:15:32Z","timestamp":1585934132000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46648-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540669043","9783540466482"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-46648-7_19","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"}]}}