Identifying multiple influential spreaders in term of the distance-based coloring

[1]  Hernán A. Makse,et al.  Influence maximization in complex networks through optimal percolation , 2015, Nature.

[2]  Y. Liu,et al.  Improving the accuracy of the k-shell method by removing redundant links: From a perspective of spreading dynamics , 2015, Scientific Reports.

[3]  Jian-Guo Liu,et al.  Iterative resource allocation based on propagation feature of node for identifying the influential nodes , 2015, ArXiv.

[4]  Ming Tang,et al.  Identifying effective multiple spreaders by coloring complex networks , 2014, ArXiv.

[5]  Jianguo Liu,et al.  Identifying the node spreading influence with largest k-core values , 2014 .

[6]  Alessandro Laio,et al.  Clustering by fast search and find of density peaks , 2014, Science.

[7]  Zhiming Zheng,et al.  Searching for superspreaders of information in real-world social media , 2014, Scientific Reports.

[8]  An Zeng,et al.  Iterative resource allocation for ranking spreaders in complex networks , 2014 .

[9]  Zhuo-Ming Ren,et al.  Effects of the distance among multiple spreaders on the spreading , 2014 .

[10]  Zhuo-Ming Ren,et al.  Effects of multiple spreaders in community networks , 2014 .

[11]  H. Makse,et al.  Spreading dynamics in complex networks , 2013, ArXiv.

[12]  Qiang Guo,et al.  Ranking the spreading influence in complex networks , 2013, ArXiv.

[13]  Y. Kivshar,et al.  Wide-band negative permeability of nonlinear metamaterials , 2012, Scientific Reports.

[14]  Lev Muchnik,et al.  Identifying influential spreaders in complex networks , 2010, 1001.5285.

[15]  Zhi-Xi Wu,et al.  Opinion Spreading And Consensus Formation On Square Lattice , 2007 .

[16]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[17]  M. Newman.  Spread of epidemic disease on networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[19]  K. Appel,et al.  Every planar map is four colorable. Part I: Discharging , 1977 .

[20]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[21]  Walter Montenarie,et al.  Springer Science and Business Media , 2004 .

[22]  L. Freeman,et al.  Centrality in social networks: ii. experimental results☆ , 1979 .

[23]  D. J. A. Welsh,et al.  An upper bound for the chromatic number of a graph and its application to timetabling problems , 1967, Comput. J..