Pajek - Analysis and Visualization of Large Networks

Batagelj, Vladimir and Mrvar, Andrej (2002) Pajek - Analysis and Visualization of Large Networks. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001, Vienna, Austria , pp. 477-478 (Official URL: http://dx.doi.org/10.1007/3-540-45848-4_54).

Full text not available from this repository.

Abstract

Pajek (spider, in Slovene) is a program package, for Windows (32 bit), for analysis and visualization of large networks (having thousands of vertices). It is freely available, for noncommercial use, at its home page: http://vlado.fmf.uni-lj.si/pub/networks/pajek/

Item Type:Conference Paper
Additional Information:10.1007/3-540-45848-4_54
Classifications:S Software and Systems > S.001 General
ID Code:523

Repository Staff Only: item control page

References

Batagelj, V., Mrvar, A. (1998): Pajek - A program for large network analysis. Connections, 21(2), 47-57.

Batagelj, V., Mrvar, A. (2000): Some analyses of Erdös collaboration graph. Social Networks, 22, 173-186.

Batagelj, V., Mrvar, A. (2001): A subquadratic triad census algorithm for large sparse networks with small maximum degree. Social Networks, 23, 237-243.

Batagelj, V., Mrvar, A., Zaversnik, M. (1999): Partitioning approach to visualization of large graphs. In J. Kratochvíl, editor, Proc. Graph Drawing: 7th International Symp. (GD '99), Lecture Notes in Comput. Sci., Berlin. Springer, pages 90-97.

White, D.R., Batagelj, V., Mrvar, A. (1999): Analyzing large kinship and marriage networks with Pgraph and Pajek. Social Science Computer Review, 17(3), 245-274.