Graph Drawing
Network Visualization
Hierarchical clustering
Multi-scale algorithms
Force-directed algorithms
Treemap algorithms

SplitFM3: Fast Layout Computation of Clustered Networks

It is a new drawing algorithm that combines space-filling and fast force-directed methods; it runs in O(n log n +m) time, where n and m are the number of vertices and edges of the network, respectively. This running time does not depend on the number of clusters, thus the algorithm guarantees good time performances independently of the structure of the cluster hierarchy. As a further advantage, the algorithm can be easily parallelized. The algorithm can be efectively used in combination with graph clustering techniques conceived for small-world and scale-free networks of medium and large size.