Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
Communications of the ACM
On finding lowest common ancestors: simplification and parallelization
SIAM Journal on Computing
A data structure for dynamic trees
Journal of Computer and System Sciences
Automatic clustering of languages
Computational Linguistics - Special issue on inheritance: II
Geometric Programming for Computer Aided Design
Geometric Programming for Computer Aided Design
Planarity-preserving clustering and embedding for large planar graphs
Computational Geometry: Theory and Applications - Fourth CGC workshop on computional geometry
Drawing Clustered Graphs on an Orthogonal Grid
GD '97 Proceedings of the 5th 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
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
Straight-Line Rectangular Drawings of Clustered Graphs
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Convex drawings of hierarchical planar graphs and clustered planar graphs
Journal of Discrete Algorithms
| Hi-index | 0.04 |
In a graph, a cluster is a set of vertices, and two clusters are said to be non-intersecting if they are disjoint or one of them is contained in the other. A clustered graph C consists of a graph G and a set of non-intersecting clusters. In this paper, we assume that C has a compound planar drawing and each cluster induces a biconnected subgraph. Then we show that such a clustered graph admits a drawing in the plane such that (i) edges are drawn as straight-line segments with no edge crossing and (ii) the boundary of the biconnected subgraph induced by each cluster is a convex polygon.