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…