Algorithms for analysis of large networks
暂无分享,去创建一个
[1] Vladimir Batagelj,et al. A subquadratic triad census algorithm for large sparse networks with small maximum degree , 2001, Soc. Networks.
[2] Jon Kleinberg,et al. Authoritative sources in a hyperlinked environment , 1998, SODA '98.
[3] Vladimir Batagelj,et al. Partitioning Approach to Visualization of Large Graphs , 1999, GD.
[4] Vladimir Batagelj,et al. Short cycle connectivity , 2007, Discret. Math..
[5] Ulrik Brandes,et al. Efficient generation of large random networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.
[6] Patrick Doreian,et al. Computational methods for social network analysis , 1990 .
[7] Vladimir Batagelj,et al. Visualisation and analysis of the internet movie database , 2007, 2007 6th International Asia-Pacific Symposium on Visualization.
[8] Stephen B. Seidman,et al. Network structure and minimum degree , 1983 .
[9] Alessandro Vespignani,et al. Large scale networks fingerprinting and visualization using the k-core decomposition , 2005, NIPS.
[10] Vladimir Batagelj,et al. Analysis of Kinship Relations With Pajek , 2008 .
[11] Vladimir Batagelj,et al. Some types of clustering with relational constraints , 1983 .
[12] Anuska Ferligoj,et al. Clustering relational data , 2008, ITI 2008 - 30th International Conference on Information Technology Interfaces.
[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..