28 search results - page 1 / 6 » Planarity-Preserving Clustering and Embedding for Large Plan... |
GD
1999
Springer
13 years 9 months ago
1999
Springer
In this paper we present a novel approach for cluster-based drawing of large planar graphs that maintains planarity. Our technique works for arbitrary planar graphs and produces a ...
GD
2005
Springer
13 years 10 months ago
2005
Springer
A clustered graph has its vertices grouped into clusters in a hierarchical way via subset inclusion, thereby imposing a tree structure on the clustering relationship. The c-planari...
GD
1998
Springer
13 years 9 months ago
1998
Springer
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
AAAI
2008
13 years 7 months ago
2008
In this paper, a bottom-up hierarchical genetic algorithm is proposed to visualize clustered data into a planar graph. To achieve global optimization by accelerating local optimiz...
WADS
2001
Springer
13 years 9 months ago
2001
Springer
Even though a large number of I/O-efficient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no space- and I/O-efficient algo...