Logo

Login | Create Account

Partitioning Approach to Visualization of Large Graphs

Batagelj, Vladimir and Mrvar, Andrej and Zaversnik, Matjaz (1999) Partitioning Approach to Visualization of Large Graphs. [Conference Paper]

Full text not available from this repository.

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.

Item Type:Conference Paper
Classifications:M Methods > M.999 Others
G Algorithms and Complexity > G.350 Clusters
P Styles > P.999 Others
ID Code:275
Deposited By:Maciejak, Agnes
Deposited On:23 Nov 2004
Last Modified:18 Sep 2008 13:08
Alternative Locations:http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=1731&spage=90

Repository Staff Only: item control page

References

1. BATAGELJ, V. (1997): Notes on Blockmodeling. Social Networks, 19, 143-155.

2. BATAGELJ, V., FERLIGOJ, A., and DOREIAN, P. (1992). Direct and Indirect Methods for Structural Equivalence. Social Networks 14, 63-90.

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.

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.

5. BATAGELJ, V., MRVAR, A. (1998): Pajek - A Program for Large Network Analysis. Connections 21 (2), 47-57.

6. FRUCHTERMAN, T. M. J., REINGOLD, E. M. (1991): Graph Drawing by Force-Directed Placement. Software, Practice and Experience 21, 1129-1164.

7. KAMADA, T., KAWAI, S. (1989): An Algorithm for Drawing General Undirected graphs. Inf. Proc. Letters 31, 7-15.

8. SEIDMAN, S. B. (1983): Network structure and minimum degree. Social Networks 5, 269-287.

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.

10. Program Pajek http://vlado.fmf.uni-lj.si/pub/networks/pajek/

GDEA is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.