Pajek -- analysis and visualization of large networks 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:

References in zbMATH (referenced in 28 articles , 1 standard article )

Showing results 1 to 20 of 28.
Sorted by year (citations)

1 2 next

  1. Murtagh, Fionn; Kurtz, Michael J.: The classification society’s bibliography over four decades: history and content analysis (2016)
  2. Cerinšek, Monika; Batagelj, Vladimir: Network analysis of Zentralblatt MATH data (2015)
  3. Estrada, Ernesto; Arrigo, Francesca: Predicting triadic closure in networks using communicability distance functions (2015)
  4. Fahimnia, Behnam; Tang, Christopher S.; Davarzani, Hoda; Sarkis, Joseph: Quantitative models for managing supply chain risks: a review (2015)
  5. Kajdanowicz, Tomasz: Relational classification using random walks in graphs (2015) ioport
  6. Mingers, John; Leydesdorff, Loet: A review of theory and practice in scientometrics (2015)
  7. Wiesberg, Stefan; Reinelt, Gerhard: Evaluating the quality of image matrices in blockmodeling (2015)
  8. Kulinich, A.A.: Software systems for situation analysis and decision support on the basis of cognitive maps: approaches and methods (2014)
  9. Hu, Jinyu; Gao, Zhiwei; Pan, Weisen: Multiangle social network recommendation algorithms and similarity network evaluation (2013)
  10. Malliaros, Fragkiskos D.; Vazirgiannis, Michalis: Clustering and community detection in directed networks: a survey (2013)
  11. Yuan, Junqing; Cao, Jinde; Xia, Bila: Arresting strategy based on dynamic criminal networks changing over time (2013)
  12. Alexandridis, Kostas; Maru, Yiheyis: Collapse and reorganization patterns of social knowledge representation in evolving semantic networks (2012) ioport
  13. Gong, Mao-Guo; Zhang, Ling-Jun; Ma, Jing-Jing; Jiao, Li-Cheng: Community detection in dynamic social networks based on multiobjective immune algorithm (2012)
  14. Batagelj, Vladimir; Zaveršnik, Matjaž: Fast algorithms for determining (generalized) core groups in social networks (2011)
  15. Oulasvirta, Antti; Lehtonen, Esko; Kurvinen, Esko; Raento, Mika: Making the ordinary visible in microblogs (2010) ioport
  16. Zacarias, M.; Pinto, H.S.; Magalhães, R.; Tribolet, J.: A `context-aware’ and agent-centric perspective for the alignment between individuals and organizations (2010) ioport
  17. Castellani, Brian; Hafferty, Frederic William: Sociology and complexity science. A new field of inquiry (2009)
  18. Creamer, Germán; Stolfo, Sal: A link mining algorithm for earnings forecast and trading (2009) ioport
  19. Estrada, Ernesto; Hatano, Naomichi: Returnability in complex directed networks (digraphs) (2009)
  20. MacArthur, Ben D.; Sánchez-García, Rubén J.; Anderson, James W.: Symmetry in complex networks (2008)

1 2 next