ImPrEd: an improved force-directed algorithm that prevents nodes from crossing edges
EuroVis'11 Proceedings of the 13th Eurographics / IEEE - VGTC conference on Visualization
Fast layout computation of clustered networks: Algorithmic advances and experimental analysis
Information Sciences: an International Journal
| Hi-index | 0.00 |
Many graphs used in real-world applications consist of nodes belonging to more than one category. We call such graph “multiple-category graphs”. Social networks are typical examples of multiple-category graphs: nodes are persons, links are friendships, and categories are communities that the persons belong to. It is often helpful to visualize both connectivity and categories of the graphs simultaneously. In this paper, we present a new visualization technique for multiple-category graphs. The technique firstly constructs hierarchical clusters of the nodes based on both connectivity and categories. It then places the nodes by a new hybrid space-filling and force-directed layout algorithm to clearly display both connectivity and category information. We show layout results using our hybrid method and compare it with other methods, and present a case study using an active biological network dataset.