Partitioning Approach to Visualization of Large Graphs

  • Vladimir Batagelj
  • Andrej Mrvar
  • Matjaž Zaveršnik
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1731)


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.


Adjacency Matrix Large Graph Main Core Partitioning Approach Residual Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    BATAGELJ, V. (1997): Notes on Blockmodeling. Social Networks, 19, 143–155.CrossRefGoogle Scholar
  2. 2.
    BATAGELJ, V., FERLIGOJ, A., and DOREIAN, P. (1992). Direct and Indirect Methods for Structural Equivalence. Social Networks 14, 63–90.CrossRefGoogle Scholar
  3. 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. 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. 5.
    BATAGELJ, V., MRVAR, A. (1998): Pajek-A Program for Large Network Analysis. Connections 21 (2), 47–57.Google Scholar
  6. 6.
    FRUCHTERMAN, T. M. J., REINGOLD, E. M. (1991): Graph Drawing by Force-Directed Placement. Software, Practice and Experience 21, 1129–1164.CrossRefGoogle Scholar
  7. 7.
    KAMADA, T., KAWAI, S. (1989): An Algorithm for Drawing General Undirected graphs. Inf. Proc. Letters 31, 7–15.zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    SEIDMAN, S. B. (1983): Network structure and minimum degree. Social Networks 5, 269–287.CrossRefMathSciNetGoogle Scholar
  9. 9.
    SNYDER, D., KICK, E. (1979): Structural position in the world system and economic growth 1955-70: A multiple network analysis of transnational interactions. American Journal of Sociology 84, 1096–1126.CrossRefGoogle Scholar
  10. 10.

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Vladimir Batagelj
    • 1
  • Andrej Mrvar
    • 2
  • Matjaž Zaveršnik
    • 1
  1. 1.Department of Theoretical Computer Science University of LjubljanaFMF, Department of Mathematics, and IMFMLjubljanaSlovenia
  2. 2.Faculty of Social SciencesUniversity of Ljubljana Kardeljeva ploščad 5LjubljanaSlovenia

Personalised recommendations