Edge concentration: a method for clustering directed graphs
SCM '89 Proceedings of the 2nd International Workshop on Software configuration management
Maintaining hierarchical graph views
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A fast multi-scale method for drawing large graphs
AVI '00 Proceedings of the working conference on Advanced visual interfaces
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
A Fully Animated Interactive System for Clustering and Navigating Huge Graphs
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Multilevel Visualization of Clustered Graphs
GD '96 Proceedings of the Symposium on Graph Drawing
On the Validity of Hierarchical Decompositions
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
| Hi-index | 0.00 |
We focus on the problem of experimentally evaluating the quality of hierarchical decompositions of trees with respect to criteria relevant in graph drawing applications. We suggest a new family of tree clustering algorithms based on the notion of t-divider and we empirically show the relevance of this concept as a generalization of the ideas of centroid and separator. We compare the t-divider based algorithms with two well-known clustering strategies suitably adapted to work on trees. The experiments analyze how the performances of the algorithms are affected by structural properties of the input tree, such as degree and balancing, and give insight in the choice of the algorithm to be used on a given tree instance.