K-core Minimization: An Edge Manipulation Approach
暂无分享,去创建一个
Xuemin Lin | Chen Chen | Xiaoyang Wang | Weijie Zhu | Xuemin Lin | Chen Chen | Xiaoyang Wang | Weijie Zhu
[1] Tim Roughgarden,et al. Preventing Unraveling in Social Networks: The Anchored k-Core Problem , 2015, SIAM J. Discret. Math..
[2] Michalis Faloutsos,et al. Eigen-Optimization on Large Graphs by Edge Manipulation , 2016, ACM Trans. Knowl. Discov. Data.
[3] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.
[4] Jeffrey Xu Yu,et al. Triangle minimization in large networks , 2014, Knowledge and Information Systems.
[5] Albert-László Barabási,et al. Error and attack tolerance of complex networks , 2000, Nature.
[6] Fan Zhang,et al. Finding Critical Users for Social Network Engagement: The Collapsed k-Core Problem , 2017, AAAI.
[7] Stephen B. Seidman,et al. Network structure and minimum degree , 1983 .
[8] Le Song,et al. Scalable diffusion-aware optimization of network topology , 2014, KDD.
[9] Subhash Khot. Ruling Out PTAS for Graph Min-Bisection, Densest Subgraph and Bipartite Clique , 2004, FOCS.
[10] Tim Roughgarden,et al. Preventing Unraveling in Social Networks: The Anchored k-Core Problem , 2012, SIAM J. Discret. Math..
[11] Jeffrey Xu Yu,et al. I/O efficient Core Graph Decomposition at web scale , 2015, 2016 IEEE 32nd International Conference on Data Engineering (ICDE).
[12] Fan Zhang,et al. OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks , 2017, Proc. VLDB Endow..
[13] Yao Zhang,et al. Near-Optimal Algorithms for Controlling Propagation at Group Scale on Networks , 2016, IEEE Transactions on Knowledge and Data Engineering.
[14] Subhash Khot,et al. Ruling out PTAS for graph min-bisection, densest subgraph and bipartite clique , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.