Navigating hierarchically clustered networks through fisheye and full-zoom methods
ACM Transactions on Computer-Human Interaction (TOCHI)
GD '95 Proceedings of the Symposium on Graph Drawing
A Bayesian Paradigm for Dynamic Graph Layout
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Multilevel Visualization of Clustered Graphs
GD '96 Proceedings of the Symposium on Graph Drawing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Dynamic Drawing of Clustered Graphs
INFOVIS '04 Proceedings of the IEEE Symposium on Information Visualization
Interactive Visualization of Small World Graphs
INFOVIS '04 Proceedings of the IEEE Symposium on Information Visualization
Topological Fisheye Views for Visualizing Large Graphs
IEEE Transactions on Visualization and Computer Graphics
Visual Exploration of Complex Time-Varying Graphs
IEEE Transactions on Visualization and Computer Graphics
ASK-GraphView: A Large Scale Graph Visualization System
IEEE Transactions on Visualization and Computer Graphics
Graph Visualization Techniques for Web Clustering Engines
IEEE Transactions on Visualization and Computer Graphics
GrouseFlocks: Steerable Exploration of Graph Hierarchy Space
IEEE Transactions on Visualization and Computer Graphics
On the Visualization of Social and other Scale-Free Networks
IEEE Transactions on Visualization and Computer Graphics
Effectiveness of Animation in Trend Visualization
IEEE Transactions on Visualization and Computer Graphics
How important is the "Mental map"?: an empirical investigation of a dynamic graph layout algorithm
GD'06 Proceedings of the 14th international conference on Graph drawing
Visualizing internet evolution on the autonomous systems level
GD'07 Proceedings of the 15th international conference on Graph drawing
Dynamic spectral layout of small worlds
GD'05 Proceedings of the 13th international conference on Graph Drawing
Dynamic graph drawing of sequences of orthogonal and hierarchical graphs
GD'04 Proceedings of the 12th international conference on Graph Drawing
Drawing large graphs with a potential-field-based multilevel algorithm
GD'04 Proceedings of the 12th international conference on Graph Drawing
EUROVIS'07 Proceedings of the 9th Joint Eurographics / IEEE VGTC conference on Visualization
Difference map readability for dynamic graphs
GD'10 Proceedings of the 18th international conference on Graph drawing
Proceedings of Graphics Interface 2011
Effective temporal graph layout: a comparative study of animation versus static display methods
Information Visualization
The readability of path-preserving clusterings of graphs
EuroVis'10 Proceedings of the 12th Eurographics / IEEE - VGTC conference on Visualization
A visualization approach for difference analysis of process models and instance traffic
BPM'13 Proceedings of the 11th international conference on Business Process Management
Visual analysis of large-scale network anomalies
IBM Journal of Research and Development
Hi-index | 0.00 |
This paper presents a technique for visualizing the differences between two graphs. The technique assumes that a unique labeling of the nodes for each graph is available, where if a pair of labels match, they correspond to the same node in both graphs. Such labeling often exists in many application areas: IP addresses in computer networks, namespaces, class names, and function names in software engineering, to name a few. As many areas of the graph may be the same in both graphs, we visualize large areas of difference through a graph hierarchy. We introduce a path-preserving coarsening technique for degree one nodes of the same classification. We also introduce a path-preserving coarsening technique based on betweenness centrality that is able to illustrate major differences between two graphs.