Structural Differences Between Two Graphs through Hierarchies
Daniel Archambault
Graphics Interface 2009, 8794.
PDF

Abstract

Presentation

Figures
Paper
PDF
(8 pages)
Abstract
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 pathpreserving coarsening technique for degree one nodes of the same classification. We also introduce a pathpreserving coarsening technique based on betweenness centrality that is able to illustrate major differences between two graphs.
Presentation
Presentation
(PDF)
Figures