ParK: An efficient algorithm for k-core decomposition on multicore processors
暂无分享,去创建一个
[1] Stanley Wasserman,et al. Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.
[2] Gary D Bader,et al. Analyzing yeast protein–protein interaction data obtained from different sources , 2002, Nature Biotechnology.
[3] Lev Muchnik,et al. Identifying influential spreaders in complex networks , 2010, 1001.5285.
[4] Josef Weidendorfer,et al. Valgrind 3.3 - Advanced Debugging and Profiling for Gnu/Linux Applications , 2008 .
[5] Julien Langou,et al. A Class of Parallel Tiled Linear Algebra Algorithms for Multicore Architectures , 2007, Parallel Comput..
[6] Jeffrey Xu Yu,et al. Efficient Core Maintenance in Large Dynamic Graphs , 2012, IEEE Transactions on Knowledge and Data Engineering.
[7] Gábor Csárdi,et al. The igraph software package for complex network research , 2006 .
[8] Miriam Baglioni,et al. Detecting dense communities in large social and information networks with the Core & Peel algorithm , 2012, ArXiv.
[9] Kun-Lung Wu,et al. Streaming Algorithms for k-core Decomposition , 2013, Proc. VLDB Endow..
[10] Christian Staudt,et al. NetworKit: An Interactive Tool Suite for High-Performance Network Analysis , 2014, ArXiv.
[11] Alessandro Vespignani,et al. K-core Decomposition: a Tool for the Visualization of Large Scale Networks , 2005, ArXiv.
[12] Joseph M. Hellerstein,et al. GraphLab: A New Framework For Parallel Machine Learning , 2010, UAI.
[13] David Eppstein,et al. Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time , 2010, Exact Complexity of NP-hard Problems.
[14] Ryan A. Rossi,et al. A Fast Parallel Maximum Clique Algorithm for Large Sparse Graphs and Temporal Strong Components , 2013, ArXiv.
[15] Yiannis Kompatsiaris,et al. Community detection in Social Media , 2012, Data Mining and Knowledge Discovery.
[16] Kunle Olukotun,et al. Efficient Parallel Graph Exploration on Multi-Core CPU and GPU , 2011, 2011 International Conference on Parallel Architectures and Compilation Techniques.
[17] Francesco De Pellegrini,et al. K-shell decomposition for dynamic complex networks , 2010, 8th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks.
[18] Stephen B. Seidman,et al. Network structure and minimum degree , 1983 .
[19] Alessandro Vespignani,et al. Large scale networks fingerprinting and visualization using the k-core decomposition , 2005, NIPS.
[20] Francesco De Pellegrini,et al. General , 1895, The Social History of Alcohol Review.
[21] Vladimir Batagelj,et al. Partitioning Approach to Visualization of Large Graphs , 1999, GD.
[22] Chen Lu,et al. Local k-core clustering for gene networks , 2013, 2013 IEEE International Conference on Bioinformatics and Biomedicine.
[23] David A. Bader,et al. Scalable Graph Exploration on Multicore Processors , 2010, 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis.
[24] Jack Dongarra,et al. A Class of Hybrid LAPACK Algorithms for Multicore and GPU Architectures , 2011, 2011 Symposium on Application Accelerators in High-Performance Computing.
[25] Alessandro Vespignani,et al. K-core decomposition of Internet graphs: hierarchies, self-similarity and measurement biases , 2005, Networks Heterog. Media.