Partitioning Approach to Visualization of Large Graphs
The structure of large graphs can be revealed by partitioning graphs to smaller parts, which are easier to handle. In the paper we propose the use of core decomposition as an efficient approach for partitioning large graphs. On the selected subgraphs, computationally more intensive, clustering and blockmodeling can be used to analyze their internal structure. The approach is illustrated by an analysis of Snyder & Kick’s world trade graph.
KeywordsAdjacency Matrix Large Graph Main Core Partitioning Approach Residual Graph
- 3.BATAGELJ, V., FERLIGOJ, A., and DOREIAN, P. (1998): Fitting Pre-Specified Blockmodels, in Data Science, Classification, and Related Methods, Eds., C. Hayashi, N. Ohsumi, K. Yajima, Y. Tanaka, H. H. Bock, and Y. Baba, Springer-Verlag, Tokyo, p.p. 199–206.Google Scholar
- 4.BATAGELJ, V., FERLIGOJ, A. (1998): Constrained Clustering Problems, in Advances in Data Science and Classification Eds., A. Rizzi, M. Vichi, H.-H. Bock, Proceedings of IFCS’98, Rome,21-24. July 1998. Springer, Berlin, p. 137–144.Google Scholar
- 5.BATAGELJ, V., MRVAR, A. (1998): Pajek-A Program for Large Network Analysis. Connections 21 (2), 47–57.Google Scholar
- 10.Program Pajek http://vlado.fmf.uni-lj.si/pub/networks/pajek/