Visual analysis of large graphs using (X,Y)-clustering and hybrid visualizations

IEEE Pacific Visualization Symposium 2010, PacificVis 2010 - Proceedings

Volumn , Issue , 2010, Pages 209-216

  Batagelj, Vladimir ^a   Didimo, Walter ^b   Liotta, Giuseppe ^b   Palladino, Pietro ^b   Patrignani, Maurizio ^c  

^a UNIVERSITY OF LJUBLJANA   (Slovenia)

^b UNIVERSITY OF PERUGIA   (Italy)

^c ROMA TRE UNIVERSITY   (Italy)

Author keywords

Graph clustering; Hybrid visualization; Large graphs; Visual analytics

Indexed keywords

COAUTHORSHIP; GRAPH CLUSTERING; INTRA-CLUSTER; LARGE GRAPHS; LARGE NETWORKS; MATRIX; MENTAL MAPS; PROOF OF CONCEPT; TOPOLOGICAL PROPERTIES; VISUAL ANALYSIS; VISUAL ANALYTICS; VISUALIZATION TOOLS;

CLUSTERING ALGORITHMS; TOPOLOGY;

VISUALIZATION;

EID: 77951679255     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PACIFICVIS.2010.5429591     Document Type: Conference Paper

References (41)

1. J. Abello, S. Kobourov, and R. Yusufov. Visualizing large graphs with compound-fisheye views and treemaps. In GD 2004, volume 3383 of LNCS, pages 431-441, 2004. (Pubitemid 41239586)
2. J. Abello, F. van Ham, and N. Krishnan. Ask-graphview: A large scale graph visualization system. IEEE Trans. Vis. Comput. Graph., 12(5):669-676, 2006.
3. M. Altaf-Ul-Amin, K. Nishikata, T. Koma, T. Miyasato, Y. Shinbo, M. Arifuzzaman, C. Wada, M. Maeda, T. Oshima, H. Mori, and S. Kanaya. Prediction of Protein Functions Based on K-Cores of Protein-Protein Interaction Networks and Amino Acid Sequences. Genome Informatics, 14:498-499, 2003.
4. D. Archambault, T. Munzner, and D. Auber. Topolayout: Multi-level graph layout by topological features. IEEE Trans. Vis. Comput. Graph., 13(2):305-317, 2007.
5. D. Auber, Y. Chiricota, F. Jourdan, and G. Melançon. Multiscale visualization of small world networks. In IEEE INFOVIS 2003, pages 75-81, 2003.
6. V. Batagelj, A. Mrvar, and M. Zaveršnik. Partitioning approach to visualization of large networks. In GD 1999, volume 1731 of LNCS, pages 90-97, 1999.
7. M. Baur and U. Brandes. Crossing reduction in circular layouts. In WG 2004, volume 3353 of LNCS, pages 332-343, 2004.
8. B. Bollobás. The evolution of sparse graphs. In A. Press, editor, Graph Theory and Combinatorics, pages 35-57, 1984.
9. F.-J. Brandenburg. Graph clustering 1: Circles of cliques. In GD 1997, volume 1353 of LNCS, pages 158-168, 1997.
10. A. Carmignani, G. D. Battista, W. Didimo, F.Matera, andM. Pizzonia. Visualization of the high level structure of the internet with HERMES. J. Graph Algorithms Appl., 6(3):281-311, 2002.
11. B. Craft and P. Cairns. Beyond guidelines: What can we learn from the visual information seeking mantra? In IEEE 9th International Conference on Information Visualization, pages 110-118, 2005.
12. G. Di Battista, W. Didimo, M. Patrignani, and M. Pizzonia. Orthogonal and quasi-upward drawings with vertices of prescribed sizes. In GD 1999, volume 1731 of LNCS, pages 297-310, 1999.
13. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing. Prentice Hall, Upper Saddle River, NJ, 1999.
14. E. Di Giacomo, W. Didimo, L. Grilli, and G. Liotta. Graph visualization techniques for web clustering engines. IEEE Trans. Vis. Comput. Graph., 13(2):294-304, 2007. (Pubitemid 46183075)
15. E. Di Giacomo, W. Didimo, G. Liotta, and P. Palladino. Visual analysis of one-to-many matched graphs. Journal of Graph Algorithms and Applications - special issues of GD 2008, 2009. to appear.
16. P. Doreian, V. Batagelj, and A. Ferligoj. Generalized Blockmodeling. Cambridge University Press, 2005.
17. S. N. Dorogovtsev, A. V. Goltsev, and J. F. F. Mendes. k-core organization of complex networks. CoRR, abs/cond-mat/0509102, 2005.
18. P. Eades. A heuristic for graph drawing. In Congressus Numerantium, volume 42, pages 149-160, 1984.
19. P. Eades, R. F. Cohen, and M. L. Huang. Online animated graph drawing for web navigation. In GD 1997, volume 1353, pages 330-335, 1997.
20. M. Eiglsperger, M. Siebenhaller, and M. Kaufmann. An efficient implementation of Sugiyama's algorithm for layered graph drawing. In GD 2004, volume 3383, pages 155-166, 2004.
21. M. Gaertler and M. Patrignani. Dynamic Analysis of the Autonomous System Graph. In IPS 2004, International Workshop on Inter-domain Performance and Simulation, Budapest, Hungary, pages 13-24, 2004.
22. E. R. Gansner, Y. Koren, and S. C. North. Topological fisheye views for visualizing large graphs. IEEE Trans. Vis. Comput. Graph., 11(4):457-468, 2005.
23. M. Ghoniem, J.-D. Fekete, and P. Castagliola. On the readability of graphs using node-link and matrix-based representations: A controlled experiment and statistical analysis. Information Visualization, 4(2):114-135, 2005.
24. A. V. Goltsev, S. N. Dorogovtsev, and J. F. F. Mendes. k-core (boot-strap) percolation on complex networks: Critical phenomena and non-local effects. CoRR, abs/cond-mat/0602611, 2006.
25. S. Hachul and M. Jünger. Large-graph layout algorithms at work: An experimental study. J. Graph Algorithms Appl., 11(2):345-369, 2007.
26. N. Henry, J.-D. Fekete, and M. J. McGuffin. Nodetrix: a hybrid visualization of social networks. IEEE Trans. Vis. Comput. Graph., 13(6):1302-1309, 2007.
27. I. Herman, G.Melançon, and M. S. Marshall. Graph visualization and navigation in information visualization: A survey. IEEE Trans. Vis. Comput. Graph., 6(1):24-43, 2000. (Pubitemid 30594718)
28. T. Itoh, C. Muelder, K. Ma, and J. Sese. A hybrid space-filling and force-directed layout method for visualizing multiple-category graphs. In IEEE PacificVis 2009, pages 121-128, 2009.
29. M. Kaufmann and D. Wagner, editors. Drawing Graphs. Springer Verlag, 2001.
30. J. Kratochvíl. String graphs II - recognizing string graphs is NP-hard. J. Comb. Theory, Ser. B, 52(1):67-78, 1991.
31. M. Ley. The DBLP computer science bibliography. http://www.informatik. uni-trier.de/~ley/db/.
32. M. Ley. The DBLPVis project. http://dblpvis.uni-trier.de/.
33. T. Łuczak. Size and connectivity of the k-core of a random graph. Discrete Mathematics, 91(1):61-68, 1991.
34. S. B. Seidman. Network structure and minimum degree. Social Networks, 5:269-287, 1983.
35. L. Shi, N. Cao, S. Liu, W. Qian, L. Tan, G. Wang, J. Sun, and C. Lin. HiMap: Adaptive visualization of large-scale online social networks. In IEEE PacificVis 2009, pages 41-48, 2009.
36. B. Shneiderman. The eyes have it: A task by data type taxonomy for information visualizations. In Proc. Visual Languages Conference, pages 336-343, 1996.
37. G. Sindre, B. Gulla, and H. G. Jokstad. Onion graphs: aesthetics and layout. In IEEE Symposium on Visual Languages, pages 287-291, 1993.
38. R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM Journal on Computing, 16(3):421-444, 1987.
39. F. van Ham and J. J. van Wijk. Interactive visualization of small world graphs. In IEEE INFOVIS 2004, pages 199-206, 2004.
40. S. Wuchty and E. Almaas. Peeling the Yeast protein network. Proteomics. 2005 Feb;5(2):444-9., 5(2):444-449, 2005.
41. S. Zhao, M. J. McGuffin, and M. H. Chignell. Elastic hierarchies: Combining treemaps and node-link diagrams. In IEEE INFOVIS 2005, page 8, 2005.