Visual Analysis of One-to-Many Matched Graphs
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 1 and G 2 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 1 and those of G 2. Our main goal is to compute a drawing of G 1 and G 2 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.
KeywordsSocial Network Analysis Visual Complexity Matched Graph Matching Edge Planar Embedding
- 1.GDToolkit: Graph drawing toolkit, http://www.dia.uniroma3.it/~gdt/
- 2.IEEE Symposium on Information Visualization (InfoVis 2007), October 28-30. IEEE Computer Society, Sacramento (2007)Google Scholar
- 4.IEEE VGTC Pacific Visualization Symposium 2008 (PacificVis 2008), Kyoto, Japan, March 4-7. IEEE Computer Society, Los Alamitos (2008)Google Scholar
- 12.Di Giacomo, E., Didimo, W., Palladino, P., Liotta, G.: Visual analysis of one-to-many matched graphs. Tech. rep, RT-003-08, DIEI - Università di Perugia, Italy (2008)Google Scholar
- 18.Masuda, S., Kashiwabara, T., Nakajima, K., Fujisawa, T.: On the NP-completeness of a computer network layout problem. In: 20th IEEE Int. Symposium on Circuits and Systems, pp. 292–295 (1987)Google Scholar