Discovering fortress-like cohesive subgraphs

[1]  Hiroyuki Ohsaki,et al.  Influence maximization problem for unknown social networks , 2015, 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM).

[2]  Ümit V. Çatalyürek,et al.  Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions , 2014, WWW.

[3]  Danah Boyd,et al.  Gaps in Information Access in Social Networks? , 2019, WWW.

[4]  Peng Zhang,et al.  Minimizing seed set selection with probabilistic coverage guarantee in a social network , 2014, KDD.

[5]  Stéphane Pérennes,et al.  On the approximability of some degree-constrained subgraph problems , 2012, Discret. Appl. Math..

[6]  Illya V. Hicks,et al.  The Minimal k-Core Problem for Modeling k-Assemblies , 2015, The Journal of Mathematical Neuroscience (JMN).

[7]  Fan Zhang,et al.  Discovering Strong Communities with User Engagement and Tie Strength , 2018, DASFAA.

[8]  Juan A. Rodríguez-Velázquez,et al.  A survey on alliances and related parameters in graphs , 2014, Electron. J. Graph Theory Appl..

[9]  Junsong Yuan,et al.  Online Processing Algorithms for Influence Maximization , 2018, SIGMOD Conference.

[10]  Lada A. Adamic,et al.  Social influence and the diffusion of user-created content , 2009, EC '09.

[11]  Lars Backstrom,et al.  Structural diversity in social contagion , 2012, Proceedings of the National Academy of Sciences.

[12]  Haixun Wang,et al.  Local search of communities in large graphs , 2014, SIGMOD Conference.

[13]  Akira Tanaka,et al.  The worst-case time complexity for generating all maximal cliques and computational experiments , 2006, Theor. Comput. Sci..

[14]  Wei Chen,et al.  Efficient influence maximization in social networks , 2009, KDD.

[15]  Nicola Barbieri,et al.  Efficient and effective community search , 2015, Data Mining and Knowledge Discovery.

[16]  Xuemin Lin,et al.  Efficient (α, β)-core Computation: an Index-based Approach , 2019, WWW.

[17]  Hirofumi Suzuki,et al.  Exact Computation of Influence Spread by Binary Decision Diagrams , 2017, WWW.

[18]  Viggo Kann,et al.  Hardness of Approximating Problems on Cubic Graphs , 1997, CIAC.

[19]  Sainyam Galhotra,et al.  Debunking the Myths of Influence Maximization: An In-Depth Benchmarking Study , 2018 .

[20]  Jon Kleinberg,et al.  Maximizing the spread of influence through a social network , 2003, KDD '03.

[21]  M E J Newman,et al.  Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.

[22]  C. Bron,et al.  Algorithm 457: finding all cliques of an undirected graph , 1973 .

[23]  Tina Eliassi-Rad,et al.  Measuring and Improving the Core Resilience of Networks , 2018, WWW.

[24]  Michael Ley,et al.  The DBLP Computer Science Bibliography: Evolution, Research Issues, Perspectives , 2002, SPIRE.

[25]  Hamamache Kheddouci,et al.  Alliance-based clustering scheme for group key management in mobile ad hoc networks , 2011, The Journal of Supercomputing.