Interactive graph matching and visual comparison of graphs and clustered graphs

  • Authors:
  • Mountaz Hascoët;Pierre Dragicevic

  • Affiliations:
  • Univ. Montpellier II, Montpellier Cedex, France;INRIA, Univ. Paris-Sud, Orsay Cedex, France

  • Venue:
  • Proceedings of the International Working Conference on Advanced Visual Interfaces
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

We introduce interactive graph matching, a process that conciliates visualization, interaction and optimization approaches to address the graph matching and graph comparison problems as a whole. Interactive graph matching is based on a multi-layered interaction model and on a visual reification of graph matching functions. We present three case studies and a system named Donatien to demonstrate the interactive graph matching approach. The three case studies involve different datasets a) subgraphs of a lexical network, b) graph of keywords extracted from the InfoVis contest benchmark, and c) clustered graphs computed from different clustering algorithms for comparison purposes.