Visual analysis of one-to-many matched graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5417 LNCS, Issue , 2009, Pages 133-144

  Di Giacomo, Emilio ^a   Didimo, Walter ^a   Liotta, Giuseppe ^a   Palladino, Pietro ^a  

^a UNIVERSITY OF PERUGIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ASPECT RATIO; DRAWING (GRAPHICS); SEARCH ENGINES;

APPLICATION EXAMPLES; DATA SET; TWO-GRAPHS; VISUAL ANALYSIS; WEB SEARCHES;

GRAPH ALGORITHMS;

EID: 68749094471     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00219-9_14     Document Type: Conference Paper

References (20)

1. GDTooLkit: Graph drawing toolkit, http://www.dia.uniroma3.it/~gdt/
2. IEEE Symposium on Information Visualization (Info Vis 2007), October 28-30. IEEE Computer Society, Sacramento (2007)
3. Hong, S.-H., Nishizeki, T., Quan, W. (eds.): GD 2007. LNCS, vol. 4875. Springer, Heidelberg (2008)
4. IEEE VGTC Pacific Visualization Symposium 2008 (PacificVis 2008), Kyoto, Japan, March 4-7. IEEE Computer Society, Los Alamitos (2008)
5. Baur, M., Brandes, U.: Crossing reduction in circular layouts. In: Hromkovic, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 332-343. Springer, Heidelberg (2004)
6. Baur, M., Brandes, U.: Multi-circular layout of micro/Macro graphs. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol. 4875, pp. 255-267. Springer, Heidelberg (2008)
7. Braß, P., Cenek, E., Duncan, C.A., Efrat, A., Erten, C., Ismailescu, D., Kobourov, S.G., Lubiw, A., Mitchell, J.S.B.: On simultaneous planar graph embeddings. Comput. Geom. Theory and Appl. 36(2), 117-130 (2007)
8. Collins, C., Carpendale, M.S.T.: Vislink: Revealing relationships amongst visualizations. IEEE Trans. Vis. Comput. Graph. 13(6), 1192-1199 (2007)
9. Di Battista, G., Didimo, W., Patrignani, M., Pizzonia, M.: Orthogonal and quasi-upward drawings with vertices of prescribed size. In: Kratochvil, J. (ed.) GD 1999. LNCS, vol. 1731, pp. 297-310. Springer, Heidelberg (1999)
10. Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice-Hall, Engle-wood Cliffs (1999)
11. Di Giacomo, E., Didimo, W., van Kreveld, M., Liotta, G., Speckmann, B.: Matched drawings of planar graphs. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol. 4875, pp. 183-194. Springer, Heidelberg (2008)
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)
13. Di Giacomo, E., Liotta, G.: Simultaneous embedding of outerplanar graphs, paths, and cycles. Intern. Journ. of Comput. Geom. and Appl. 17(2), 139-160 (2007)
14. Erten, C., Harding, P.J., Kobourov, S.G., Wampler, K., Yee, G.V.: Graphael: Graph animations with evolving layouts. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 98-110. Springer, Heidelberg (2004)
15. Erten, C., Kobourov, S.G.: Simultaneous embedding of a planar graph and its dual on the grid. Theory Comput. Syst. 38(3), 313-327 (2005)
16. Erten, C., Kobourov, S.G., Le, V., Navabi, A.: Simultaneous graph drawing: Layout algorithms and visualization schemes. Journ. Graph Alg. and Appl. 9(1), 165-182 (2005)
17. Gutwenger, C., Klein, K., Mutzel, P.: Planarity testing and optimal edge insertion with embedding constraints. Journ. of Graph Alg. and Appl. 12(1), 73-95 (2008)
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)
19. Shneiderman, B., Aris, A.: Network visualization by semantic substrates. IEEE Trans. Vis. Comput. Graph. 12(5), 733-740 (2006)
20. Six, J.M., Tollis, I.G.: A framework and algorithms for circular drawings of graphs. Journ. of Discr. Alg. 4(1), 25-50 (2006)