On Density-based Local Community Search
Summary: Proposes density-based Local Community Search (LCS) with seed set R, optimizing f(S) over induced subgraphs to blend density/conductance with R-inclusion, aiming for strongly local computation. Introduces a configuration-based framework; for density-based LCS, it identifies C_L as configurations enabling strongly local optimization and provides an LP-based, deployable solution. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yizhou Dai
- 2. Miao Qiao
- 3. Rong-Hua Li
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,057 | Budgeted Strong Community Search in Heterogeneous Graphs | 2026 | SIGMOD | 5.1725247e-05 |
| 10,689 | Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory | 2025 | VLDB | 5.1725247e-05 |
| 10,702 | Effective and Efficient Community Search for Complex Network Semantics Capture: From Coarse-Grain to Fine-Grain | 2025 | VLDB | 5.1725247e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,460 | Finding Locally Densest Subgraphs: A Convex Programming Approach | 2022 | VLDB | 7.470212e-05 |
| 4,823 | Anchored Densest Subgraph | 2022 | SIGMOD | 6.5592921e-05 |
| 5,124 | Discovering Polarization Niches via Dense Subgraphs with Attractors and Repulsers | 2022 | VLDB | 6.4185009e-05 |
Previous
Page 1 / 1
Next