An algorithm for drawing general undirected graphs
Information Processing Letters
Graph drawing by force-directed placement
Software—Practice & Experience
The role of another spatial dimension in software visualization
ACM Transactions on Information Systems (TOIS)
Theoretical Computer Science
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Designing Pixel-Oriented Visualization Techniques: Theory and Applications
IEEE Transactions on Visualization and Computer Graphics
Communicating Centrality in Policy Network Drawings
IEEE Transactions on Visualization and Computer Graphics
Visual Unrolling of Network Evolution and the Analysis of Dynamic Discourse
INFOVIS '02 Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02)
Graph Drawing Software
Parallel coordinates: a tool for visualizing multi-dimensional geometry
VIS '90 Proceedings of the 1st conference on Visualization '90
GEOMI: GEOmetry for maximum insight
GD'05 Proceedings of the 13th international conference on Graph Drawing
Graph drawing by stress majorization
GD'04 Proceedings of the 12th international conference on Graph Drawing
Automatic detection of cohesive subgroups within social hypertext: A heuristic approach
The New Review of Hypermedia and Multimedia
Centralities: capturing the fuzzy notion of importance in social graphs
Proceedings of the Second ACM EuroSys Workshop on Social Network Systems
GEOMI: GEOmetry for maximum insight
GD'05 Proceedings of the 13th international conference on Graph Drawing
Control and visualization system for managed self-organization network
Proceedings of the 7th International Conference on Network and Services Management
Vertigo zoom: combining relational and temporal perspectives on dynamic networks
Proceedings of the International Working Conference on Advanced Visual Interfaces
Visual comparison for information visualization
Information Visualization - Special issue on State of the Field and New Research Directions
AusDM '09 Proceedings of the Eighth Australasian Data Mining Conference - Volume 101
Entropy Based Sensitivity Analysis and Visualization of Social Networks
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Hi-index | 0.00 |
Centrality analysis determines the importance of vertices in a network based on their connectivity within the network structure. It is a widely used technique to analyse network-structured data. A particularly important task is the comparison of different centrality measures within one network. We present three methods for the exploration and comparison of centrality measures within a network: 3D parallel coordinates orbit-based comparison and hierarchy-based comparison. There is a common underlying idea to all three methods: for each centrality measure the graph is copied and drawn in a separate 2D plane with vertex position dependent on centrality. These planes are then stacked into the third dimension so that the different centrality measures may be easily compared. Only the details of how centrality is mapped to vertex position are dierent in each method. For 3D parallel coordinates vertices are placed on vertical lines; for orbit-based comparison vertices are placed on concentric circles and for hierarchy-based comparison vertices are placed on horizontal lines. The second and third solutions make it particularly easy to track changing vertex-centrality values in the context of the underlying network structure. The usability of these methods is demonstrated on biological and social networks.