Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters

Authors:
Vít Jelínek;Eva Jelínková;Jan Kratochvíl;Bernard Lidický
Affiliations:
Department of Applied Mathematics,;Department of Applied Mathematics,;Department of Applied Mathematics, and Institute for Theoretical Computer Science, Charles University, Praha, Czech Republic 118 00;Department of Applied Mathematics,
Venue:
Graph Drawing
Year:
2009

Citing 8
Cited 2

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
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
On embedding a cycle in a plane graph

GD'05 Proceedings of the 13th 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

Splitting clusters to get c-planarity

GD'09 Proceedings of the 17th international conference on Graph Drawing
Shrinking the search space for clustered planarity

GD'12 Proceedings of the 20th international conference on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a polynomial-time algorithm for c-planarity testing of clustered graphs with fixed plane embedding and such that every cluster induces a subgraph with at most two connected components.