Influential Community Search in Large Networks
Summary: Proposes a k-influential community model based on k-core to capture a community's influence in large networks. Delivers a linear-time online top-r search and a linear-space index with update maintenance for scalable, real-time influential-community discovery, validated on 7 real networks. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Rong-Hua Li (Shenzhen University)
- 2. Lu Qin (University of Technology Sydney)
- 3. Jeffrey Xu Yu (Chinese University of Hong Kong)
- 4. Rui Mao (Shenzhen University)
BibTeX Citation
@article{li_vldb15,
title = {{Influential Community Search in Large Networks}},
author = {Li, Rong-Hua and Qin, Lu and Yu, Jeffrey Xu and Mao, Rui},
journal = {PVLDB},
series = {{VLDB} '15},
volume = {8},
number = {5},
pages = {509--520},
doi = {10.14778/2735479.2735485},
url = {https://doi.org/10.14778/2735479.2735485},
year = {2015}
}Incoming Citations (Sorted by Pagerank)
Showing 33 of 33 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 96 | Truss Decomposition in Massive Networks | 2012 | VLDB | 0.00034261728 |
| 182 | Querying K-Truss Community in Large and Dynamic Graphs | 2014 | SIGMOD | 0.00026383593 |
| 255 | On Triangulation-based Dense Neighborhood Graph Discovery | 2011 | VLDB | 0.00022949287 |
| 274 | Online Search of Overlapping Communities | 2013 | SIGMOD | 0.00022499515 |
| 276 | Local Search of Communities in Large Graphs | 2014 | SIGMOD | 0.00022377798 |
| 580 | Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis | 2013 | VLDB | 0.00016057466 |
| 599 | Massive Graph Triangulation | 2013 | SIGMOD | 0.00015700433 |
| 643 | Finding Maximal Cliques in Massive Networks by H*-graph | 2010 | SIGMOD | 0.00015219469 |
| 732 | Streaming Algorithms for k-core Decomposition | 2013 | VLDB | 0.00014341313 |
| 4,567 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD | 6.5173666e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 696 | Effective Community Search for Large Attributed Graphs | 2016 | VLDB |
| 2 | 4,595 | Influential Community Search over Large Heterogeneous Information Networks | 2023 | VLDB |
| 3 | 10,394 | Effective Structurally Similar Community Search in Large Temporal Graphs | 2027 | SIGMOD |
| 4 | 4,973 | Effective Community Search over Large Star-Schema Heterogeneous Information Networks | 2022 | VLDB |
| 5 | 11,390 | Effective and Efficient Community Search for Complex Network Semantics Capture: From Coarse-Grain to Fine-Grain | 2025 | VLDB |
| 6 | 5,561 | Reliable Community Search in Dynamic Networks | 2022 | VLDB |
| 7 | 10,708 | Efficient Influential Community Search over Dynamic Graphs | 2026 | SIGMOD |
| 8 | 7,165 | Topic-based Community Search over Spatial-Social Networks | 2020 | VLDB |
| 9 | 182 | Querying K-Truss Community in Large and Dynamic Graphs | 2014 | SIGMOD |
| 10 | 4,861 | An Optimal and Progressive Approach to Online Search of Top-K Influential Communities | 2018 | VLDB |