[Kempe-Kleinberg-Tardos. KDD'03]による影響最大化の定式化の際に情報拡散モデルとして独立カスケードと線形閾値モデルが採用・提案された．インパクトが大きく，扱いやすかったので，特に独立カスケードは拡張・変種が沢山生み出されている． 一方で，拡散…

(Paper ID: 53) Panther: Fast Top-k Similarity Search on Large Networks Jing Zhang, Tsinghua university; Jie Tang*, Tsinghua University; Cong Ma, Tsinghua; Hanghang Tong, ASU; Yu Jing, Tsinghua; Juanzi Li, Tsinghua University (Paper ID: 54)…

004 Finding Dense and Connected Subgraphs in Dual Networks Yubao Wu, Ruoming Jin, Xiaofeng Zhu, Xiang Zhang 050 Multi-Constrained Graph Pattern Matching in Large-Scale Contextual Social Graphs 073 Multicore Triangle Computations Without Tu…

Paper ID: 81 - A Fast Local Search for Mnimum Vertex Cover in Massive Graphs Shaowei Cai (Chinese Academy of Sciences) Paper ID: 213 - A Scalable Community Detection Algorithm for Large Graphs Using Stochastic Block Models Chengbin Peng (K…

The k-clique Densest Subgraph Problem Path Sampling: A Fast and Provable Method for Estimating 4-Vertex Subgraph Counts A Game Theoretic Model for the Formation of Navigable Small-World Networks Discovering Meta-Paths in Large Heterogeneou…

GetReal: Towards Realistic Selection of Influence Maximization Strategies in Competitive Networks BEAR: Block Elimination Approach for Random Walk with Restart on Large Graphs Minimum Spanning Trees in Temporal Graphs Influence Maximizatio…