Visualizing Differences between Two Large Graphs
When working with graphs one often faces the problem of comparing two or more graphs. For example in biology, when two protein-protein interaction networks from closely related species have to be compared, the graphs can easily contain several hundred nodes and thousands of edges but very few differences. Our goal was to develop a software-tool that creates an overview of large graphs and maintains the structure but reduces the number of nodes and edges and enables the user to easily find and investigate the areas of interest. This problem has been considered in the past by various groups (, ) and different heuristics have been proposed. Here, we follow the concept proposed in . For this work, we assume that the input-graphs are relatively large with small local differences and node correspondences are known.
- 1.Chimani, M., Jünger, M., Schulz, M.: Crossing minimization meets simultaneous drawing. In: PacificVis, pp. 33–40. IEEE, Los Alamitos (2008)Google Scholar
- 3.Albrecht, M., Estrella-Balderrama, A., Geyer, M., Gutwenger, C., Klein, K., Kohlbacher, O., Schulz, M.: Visually comparing a set of graphs. In: Borgatti, S.P., Kobourov, S., Kohlbacher, O., Mutzel, P. (eds.) Graph Drawing with Applications to Bioinformatics and Social Sciences, Dagstuhl Seminar Proceedings, Dagstuhl, Germany, vol. 8191 (2008)Google Scholar
- 5.yWorks GMbH: yFiles graph library, http://www.yworks.com