{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:32:24Z","timestamp":1725564744872},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540204527"},{"type":"electronic","value":"9783540398905"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39890-5_15","type":"book-chapter","created":{"date-parts":[[2010,9,4]],"date-time":"2010-09-04T01:16:57Z","timestamp":1283563017000},"page":"168-179","source":"Crossref","is-referenced-by-count":6,"title":["Completely Connected Clustered Graphs"],"prefix":"10.1007","author":[{"given":"Sabine","family":"Cornelsen","sequence":"first","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/3-540-46648-7_20","volume-title":"Graph Drawing","author":"F. Bertault","year":"1999","unstructured":"Bertault, F., Miller, M.: An algorithm for drawing compound graphs. In: Kratochv\u00edl, J. (ed.) GD 1999. LNCS, vol.\u00a01731, pp. 197\u2013204. Springer, Heidelberg (1999)"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/3-540-44541-2_10","volume-title":"Graph Drawing","author":"U. Brandes","year":"2001","unstructured":"Brandes, U., Cornelsen, S., Wagner, D.: How to draw the minimum cuts of a planar graph. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 103\u2013114. Springer, Heidelberg (2001)"},{"key":"15_CR3","unstructured":"Cornelsen, S.: Drawing Families of Cuts in a Graph. PhD thesis, Universit\u00e4t Konstanz (2003), http:\/\/www.ub.uni-konstanz.de\/kops\/volltexte\/2003\/975\/"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BFb0054325","volume-title":"LATIN\u201998: Theoretical Informatics","author":"E. Dahlhaus","year":"1998","unstructured":"Dahlhaus, E.: A linear time algorithm to recognize clustered planar graphs and its parallelization. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998. LNCS, vol.\u00a01380, pp. 239\u2013248. Springer, Heidelberg (1998)"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/3-540-45848-4_5","volume-title":"Graph Drawing","author":"G. Battista Di","year":"2002","unstructured":"Di Battista, G., Didimo, W., Marcandalli, A.: Planarization of clustered graphs. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol.\u00a02265, pp. 60\u201374. Springer, Heidelberg (2002)"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BFb0030816","volume-title":"Computing and Combinatorics","author":"P. Eades","year":"1995","unstructured":"Eades, P., Cohen, R.F., Feng, Q.: How to draw a planar clustered graph. In: Li, M., Du, D.-Z. (eds.) COCOON 1995. LNCS, vol.\u00a0959, pp. 21\u201330. Springer, Heidelberg (1995)"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Eades, P., Feng, Q.: Multilevel visualization of clustered graphs. In: North [18], pp. 101\u2013112","DOI":"10.1007\/3-540-62495-3_41"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Eades, P., Feng, Q., Lin, X.: Straight-line drawing algorithms for hierarchical graphs and clustered graphs. In: North [18], pp. 146\u2013157","DOI":"10.1007\/3-540-62495-3_42"},{"issue":"4","key":"15_CR9","doi-asserted-by":"crossref","first-page":"3","DOI":"10.7155\/jgaa.00016","volume":"3","author":"P. Eades","year":"1999","unstructured":"Eades, P., Feng, Q., Nagamochi, H.: Drawing clustered graphs on an orthogonal grid. Journal on Graph Algorithms and Applications\u00a03(4), 3\u201329 (1999)","journal-title":"Journal on Graph Algorithms and Applications"},{"key":"15_CR10","unstructured":"Eades, P., Nagamochi, H., Feng, Q.: Straight-line drawing algorithms for hierarchical graphs and clustered graphs. Technical Report 98\u201303, Department of Computer Science and Software Engineering, University of Newcastle, Australia (1998), Available at ftp:\/\/ftp.cs.newcastle.edu.au\/pub\/techreports\/tr98-03.ps.Z"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/3-540-60313-1_145","volume-title":"Algorithms - ESA \u201995","author":"Q. Feng","year":"1995","unstructured":"Feng, Q., Cohen, R.F., Eades, P.: Planarity for clustered graphs. In: Spirakis, P.G. (ed.) ESA 1995. LNCS, vol.\u00a0979, pp. 213\u2013226. Springer, Heidelberg (1995)"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"Graph Drawing","year":"2002","unstructured":"Goodrich, M.T., Kobourov, S.G. (eds.): GD 2002. LNCS, vol.\u00a02528. Springer, Heidelberg (2002)"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Gutwenger, C., J\u00fcnger, M., Leipert, S., Mutzel, P., Percan, M., Weiskircher, R.: Advances in c-planarity testing of clustered graphs. In: Goodrich and Kobourov [12], pp. 220\u2013235","DOI":"10.1007\/3-540-36151-0_21"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/3-540-37623-2_29","volume-title":"Graph Drawing","author":"M.L. Huang","year":"1999","unstructured":"Huang, M.L., Eades, P.: A fully animated interactive system for clustering and navigating huge graphs. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol.\u00a01547, pp. 374\u2013383. Springer, Heidelberg (1999)"},{"key":"15_CR15","unstructured":"J\u00fcnger, M., Leipert, S., Percan, M.: Triangulating clustered graphs. Technical Report zaik2002\u2013444, Zentrum f\u00fcr Angewandte Informatik K\u00f6ln (2002), Available at http:\/\/www.zaik.uni-koeln.de\/%7Epaper\/preprints.html?show=zaik2002-444"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/BFb0028270","volume-title":"Algorithms and Data Structures","author":"G. Kant","year":"1991","unstructured":"Kant, G., Bodlaender, H.L.: Planar graph augmentation problems. In: Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1991. LNCS, vol.\u00a0519, pp. 286\u2013298. Springer, Heidelberg (1991)"},{"key":"15_CR17","unstructured":"L\u00fctke-H\u00fcttmann, D.: Knickminimales Zeichnen 4-planarer Clustergraphen. Master\u2019s thesis, Universit\u00e4t des Saarlandes, Diplomarbeit (1999)"},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","volume-title":"Graph Drawing","year":"1997","unstructured":"North, S.C. (ed.): GD 1996. LNCS, vol.\u00a01190. Springer, Heidelberg (1997)"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Raitner, M.: HGV: A library for hierarchies, graphs, and views. In: Goodrich and Kobourov [12], pp. 236\u2013243","DOI":"10.1007\/3-540-36151-0_22"},{"key":"15_CR20","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1109\/21.108304","volume":"21","author":"K. Sugiyama","year":"1991","unstructured":"Sugiyama, K., Misue, K.: Visualization of structural information: Automativ drawing of compound digraphs. IEEE Transactions on Systems, Man and Cybernetics\u00a021, 876\u2013892 (1991)","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"15_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/BFb0021835","volume-title":"Graph Drawing","author":"X. Wang","year":"1996","unstructured":"Wang, X., Miyamoto, I.: Generating customized layouts. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol.\u00a01027, pp. 504\u2013515. Springer, Heidelberg (1996)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39890-5_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T13:18:49Z","timestamp":1559567929000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39890-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540204527","9783540398905"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39890-5_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}