Visual Analysis of One-To-Many Matched Graphs

Abstract

Motivated by applications of social network analysis and of Web search clustering engines, we describe an algorithm and a system for the display and the visual analysis of two graphs G₁ and G₂ such that each G_i is defined on a different data set with its own primary relationships and there are secondary relationships between the vertices of G₁ and those of G₂. Our main goal is to compute a drawing of G₁ and G₂ that makes clearly visible the relations between the two graphs by avoiding their crossings, and that also takes into account some other important aesthetic requirements like number of bends, area, and aspect ratio. Application examples and experiments on the system performances are also presented.