Structural Differences Between Two Graphs through Hierarchies - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Structural Differences Between Two Graphs through Hierarchies

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.
Fichier principal
Vignette du fichier
majorDifferences.pdf (6.61 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00413854 , version 1 (29-11-2010)

Identifiers

  • HAL Id : inria-00413854 , version 1

Cite

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

Collections

CNRS INRIA INRIA2
147 View
185 Download

Share

Gmail Facebook Twitter LinkedIn More