Sciweavers

GRAPHICSINTERFACE
2009

Structural differences between two graphs through hierarchies

13 years 1 months ago
Structural differences between two graphs through hierarchies
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.
Daniel Archambault
Added 18 Feb 2011
Updated 18 Feb 2011
Type Journal
Year 2009
Where GRAPHICSINTERFACE
Authors Daniel Archambault
Comments (0)