Journal of the ACM (JACM)
Advances in C-Planarity Testing of Clustered Graphs
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
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
Efficient C-planarity testing for embedded flat clustered graphs with small faces
GD'07 Proceedings of the 15th international conference on Graph drawing
Clustered planarity: small clusters in Eulerian graphs
GD'07 Proceedings of the 15th international conference on Graph drawing
C-planarity of extrovert clustered graphs
GD'05 Proceedings of the 13th international conference on Graph Drawing
Clustering cycles into cycles of clusters
GD'04 Proceedings of the 12th international conference on Graph Drawing
Shrinking the search space for clustered planarity
GD'12 Proceedings of the 20th international conference on Graph Drawing
| Hi-index | 0.00 |
We present a linear algorithm for c-planarity testing of clustered graphs, in which every cluster has at most four outgoing edges.