Abstract
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.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
BATAGELJ, V. (1997): Notes on Blockmodeling. Social Networks, 19, 143–155.
BATAGELJ, V., FERLIGOJ, A., and DOREIAN, P. (1992). Direct and Indirect Methods for Structural Equivalence. Social Networks14, 63–90.
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.
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.
BATAGELJ, V., MRVAR, A. (1998): Pajek-A Program for Large Network Analysis. Connections21 (2), 47–57.
FRUCHTERMAN, T. M. J., REINGOLD, E. M. (1991): Graph Drawing by Force-Directed Placement. Software, Practice and Experience21, 1129–1164.
KAMADA, T., KAWAI, S. (1989): An Algorithm for Drawing General Undirected graphs. Inf. Proc. Letters31, 7–15.
SEIDMAN, S. B. (1983): Network structure and minimum degree. Social Networks5, 269–287.
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 Sociology84, 1096–1126.
Program Pajek http://vlado.fmf.uni-lj.si/pub/networks/pajek/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Batagelj, V., Mrvar, A., Zaveršnik, M. (1999). Partitioning Approach to Visualization of Large Graphs. In: Kratochvíyl, J. (eds) Graph Drawing. GD 1999. Lecture Notes in Computer Science, vol 1731. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46648-7_9
Download citation
DOI: https://doi.org/10.1007/3-540-46648-7_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66904-3
Online ISBN: 978-3-540-46648-2
eBook Packages: Springer Book Archive