Pajek - Analysis and Visualization of Large Networks

[1]  Vladimir Batagelj,et al.  An O(m) Algorithm for Cores Decomposition of Networks , 2003, ArXiv.

[2]  Vladimir Batagelj,et al.  Efficient Algorithms for Citation Network Analysis , 2003, ArXiv.

[3]  Margaret Ann Neale,et al.  Winners (don't) take all , 2003 .

[4]  V. Batagelj,et al.  ANALYSIS AND VISUALIZATION OF LARGE NETWORKS , 2003 .

[5]  Vladimir Batagelj,et al.  Analiza rodoslova dubrovačkog vlasteoskog kruga pomoću programa Pajek , 2002 .

[6]  David M. Pennock,et al.  Winners don't take all: Characterizing the competition for links on the web , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[7]  Vladimir Batagelj,et al.  Generalized Cores , 2002, ArXiv.

[8]  Sowmyanarayanan Sadagopan,et al.  WWW: service provider , 2002, UBIQ.

[9]  Gary D Bader,et al.  Systematic identification of protein complexes in Saccharomyces cerevisiae by mass spectrometry , 2002, Nature.

[10]  Vladimir Batagelj,et al.  Analysis and visualization of 2-mode networks , 2002 .

[11]  Vladimir Batagelj,et al.  A subquadratic triad census algorithm for large sparse networks with small maximum degree , 2001, Soc. Networks.

[12]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[13]  Vladimir Batagelj,et al.  Some analyses of Erdős collaboration graph , 2000, Soc. Networks.

[14]  Vladimir Batagelj,et al.  Symmetric-Acyclic Decompositions of Networks , 2000, J. Classif..

[15]  Vladimir Batagelj,et al.  Partitioning Approach to Visualization of Large Graphs , 1999, GD.

[16]  M. KleinbergJon.  Authoritative sources in a hyperlinked environment , 1999 .

[17]  V. Batagelj,et al.  Anthropology: Analyzing large kinship and marriage networks with Pgraph and Pajek , 1999 .

[18]  Vladimir Batagelj,et al.  Pajek - Program for Large Network Analysis , 1999 .

[19]  V. Batagelj.  Notes on blockmodeling , 1997 .

[20]  S. Wasserman,et al.  Logit models and logistic regressions for social networks: I. An introduction to Markov graphs andp , 1996 .

[21]  P. Doreian,et al.  A partitioning approach to structural balance , 1996 .

[22]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.

[23]  Valentina Hlebec.  Recall Versus Recognition : Comparison of the Two Alternative Procedures for Collecting Social Network Data , 1993 .

[24]  A. Ferligoj,et al.  An optimizational approach to regular equivalence , 1992 .

[25]  John Scott.  Social Network Analysis , 1988 .

[26]  Robin Wilson,et al.  Graphs an Introductory Approach , 1990, The Mathematical Gazette.

[27]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[28]  James A. McHugh,et al.  Algorithmic Graph Theory , 1986 .

[29]  Norman P. Hummon,et al.  Connectivity in a citation network: The development of DNA theory☆ , 1989 .

[30]  Fionn Murtagh,et al.  Multidimensional clustering algorithms , 1985 .

[31]  Stephen B. Seidman,et al.  Network structure and minimum degree , 1983 .

[32]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[33]  Eugene Garfield,et al.  THE USE OF CITATION DATA IN WRITING THE HISTORY OF SCIENCE , 1964 .