Pier Francesco Cortese
- T. C. Biedl, M. Kaufmann, and P. Mutzel. Drawing planar partitions II: HH-Drawings. In Workshop on Graph-Theoretic Concepts in Computer Science (WG'98), volume 1517, pages 124--136. Springer-Verlag, 1998. Google Scholar
Digital Library
- S. Cornelsen and D. Wagner. Completely connected clustered graphs. In Proc. 29th Intl. Workshop on Graph-Theoretic Concepts in Computer Science (WG 2003), volume 2880 of LNCS, pages 168--179. Springer-Verlag, 2003.Google ScholarCross Ref
- P. F. Cortese, G. Di Battista, M. Patrignani, and M. Pizzonia. Clustering cycles into cycles of clusters. In J. Pach, editor, Proc. Graph Drawing 2004 (GD'04), volume 3383 of LNCS, pages 100--110. Springer-Verlag, 2004. Google ScholarDigital Library
- E. Dahlhaus. Linear time algorithm to recognize clustered planar graphs and its parallelization. In C. Lucchesi, editor, LATIN '98, 3rd Latin American symposium on theoretical informatics, Campinas, Brazil, April 20--24, 1998, volume 1380 of LNCS, pages 239--248, 1998. Google ScholarDigital Library
- G. Di Battista, W. Didimo, and A. Marcandalli. Planarization of clustered graphs. In Proc. Graph Drawing 2001 (GD'01), LNCS, pages 60--74. Springer-Verlag, 2001. Google ScholarDigital Library
- G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing. Prentice Hall, Upper Saddle River, NJ, 1999.Google Scholar
- G. Di Battista, W. P. Liu, and I. Rival. Bipartite graphs, upward drawings, and planarity. Information Processign Letters, 36(6):317--322, 1990. Google ScholarDigital Library
- C. A. Duncan, M. T. Goodrich, and S. G. Kobourov. Planarity-preserving clustering and embedding for large planar graphs. J. Computational Geometry, 24(2):95--114, 2003. Google ScholarDigital Library
- P. Eades and Q. W. Feng. Multilevel visualization of clustered graphs. In S. C. North, editor, Proc. Graph Drawing 1996 (GD'96), volume 1190 of LNCS, pages 101--112. Springer-Verlag, 1997. Google ScholarDigital Library
- P. Eades, Q. W. Feng, and X. Lin. Straight line drawing algorithms for hierarchical graphs and clustered graphs. In S. C. North, editor, Proc. Graph Drawing 1996 (GD'96), volume 1190 of LNCS, pages 113--128. Springer-Verlag, 1997. Google ScholarDigital Library
- P. Eades, Q.-W. Feng, and H. Nagamochi. Drawing clustered graphs on an orthogonal grid. J. Graph Algorithms Appl., 3(4):3--29, 1999.Google ScholarCross Ref
- Q. Feng. Algorithms for Drawing Clustered Graphs. PhD thesis, Department of Computer Science and Software engineering, University of Newclastle, Apr. 1997.Google Scholar
- Q. W. Feng, R. F. Cohen, and P. Eades. Planarity for clustered graphs. In P. Spirakis, editor, Symposium on Algorithms (Proc. ESA '95), volume 979 of LNCS, pages 213--226. Springer-Verlag, 1995. Google ScholarDigital Library
- C. Gutwenger, M. Jnger, S. Leipert, P. Mutzel, M. Percan, and R. Weiskircher. Subgraph induced planar connectivity augmentation. In 29-th Workshop on Graph-Theoretic Concepts in Computer Science (WG 2003), volume 2880 of LNCS, pages 261--272. Springer-Verlag, 2003.Google Scholar
- C. Gutwenger, M. Jünger, S. Leipert, P. Mutzel, M. Percan, and R. Weiskircher. Advances in C-planarity testing of clustered graphs. In S. G. Kobourov and M. T. Goodrich, editors, Proc. Graph Drawing 2002 (GD'02), volume 2528 of LNCS, pages 220--235. Springer-Verlag, 2002. Google ScholarDigital Library
- T. Lengauer. Hierarchical planarity testing algorithms. J. ACM, 36(3):474--509, 1989. Google ScholarDigital Library
- H. Nagamochi and K. Kuroya. Convex drawing for c-planar biconnected clustered graphs. In G. Liotta, editor, Proc. Graph Drawing 2003 (GD'03), volume 2912 of LNCS, pages 369--380. Springer-Verlag, 2004.Google Scholar
Index Terms
- Clustered planarity
Recommendations
Relaxing the constraints of clustered planarity
In a drawing of a clustered graph vertices and edges are drawn as points and curves, respectively, while clusters are represented by simple closed regions. A drawing of a clustered graph is c-planar if it has no edge-edge, edge-region, or region-region ...
Planarity of streamed graphs
AbstractIn this paper we introduce a notion of planarity for graphs that are presented in a streaming fashion. A streamed graph is a stream of edges e 1 , e 2 , … , e m on a vertex set V. A streamed graph is ω-stream planar with respect to a ...
On the Planar Split Thickness of Graphs
Motivated by applications in graph drawing and information visualization, we examine the planar split thickness of a graph, that is, the smallest k such that the graph is k-splittable into a planar graph. A k-split operation substitutes a vertex v by at ...
Comments