Skip to Main content Skip to Navigation
Conference papers

Structural Differences Between Two Graphs through Hierarchies

Daniel Archambault 1, 2
2 GRAVITE - Graph Visualization and Interactive Exploration
CNRS - Centre National de la Recherche Scientifique : UMR, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Inria Bordeaux - Sud-Ouest, Université Sciences et Technologies - Bordeaux 1
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 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download
Contributor : Daniel Archambault <>
Submitted on : Monday, November 29, 2010 - 2:20:50 PM
Last modification on : Tuesday, February 9, 2021 - 3:14:02 PM
Long-term archiving on: : Wednesday, November 30, 2016 - 9:59:44 AM


Files produced by the author(s)


  • HAL Id : inria-00413854, version 1



Daniel Archambault. Structural Differences Between Two Graphs through Hierarchies. Graphics Interface, May 2009, Kelowna, Canada. pp.87--94. ⟨inria-00413854⟩



Record views


Files downloads