Hierarchical planarity testing algorithms
Journal of the ACM (JACM)
Graph Algorithms
How to Draw a Planar Clustered Graph
COCOON '95 Proceedings of the First Annual International Conference on Computing and Combinatorics
Planarization of Clustered Graphs
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Advances in C-Planarity Testing of Clustered Graphs
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Drawing Planar Partitions II: HH-Drawings
WG '98 Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science
Planarity for Clustered Graphs
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
A Linear Time Algorithm to Recognize Clustered Graphs and Its Parallelization
LATIN '98 Proceedings of the Third Latin American Symposium on Theoretical Informatics
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Clustering cycles into cycles of clusters
GD'04 Proceedings of the 12th international conference on Graph Drawing
Minimizing intra-edge crossings in wiring diagrams and public transportation maps
GD'06 Proceedings of the 14th international conference on Graph drawing
Efficient C-planarity testing for embedded flat clustered graphs with small faces
GD'07 Proceedings of the 15th international conference on Graph drawing
| Hi-index | 0.00 |
Consider a planar drawing ${\it \Gamma}$of a planar graph G such that the vertices are drawn as small circles and the edges are drawn as thin strips. Consider a cycle c of G. Is it possible to draw c as a non-intersecting closed curve inside ${\it \Gamma}$, following the circles that correspond in ${\it \Gamma}$to the vertices of c and the strips that connect them? We show that this test can be done in polynomial time and study this problem in the framework of clustered planarity for highly non-connected clustered graphs.