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/
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., 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., Zaveršnik M. (1999): Partitioning Approach to Visualization of Large Graphs. Kratochvil, J. (Ed.) Graph Drawing. 7th International Symposium, GD’99, Štiřin Castle, Czech Republic, Proceedings. Lecture Notes in Computer Science, 1731. Springer-Verlag, Berlin/Heidelberg, 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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Batagelj, V., Mrvar, A. (2002). Pajek— Analysis and Visualization of Large Networks. In: Mutzel, P., Jünger, M., Leipert, S. (eds) Graph Drawing. GD 2001. Lecture Notes in Computer Science, vol 2265. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45848-4_54
Download citation
DOI: https://doi.org/10.1007/3-540-45848-4_54
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43309-5
Online ISBN: 978-3-540-45848-7
eBook Packages: Springer Book Archive