DBScholar

Back to papers

Efficient Influential Community Search over Dynamic Graphs

Summary: Dynamic influential-community search on large graphs. New ICD-order enables provably efficient maintenance of IC indexes under edge insertions/deletions, avoiding unbounded static-index updates; up to 10^6× faster than prior methods. (summarized by gpt-5.4-mini on Apr 11 2026)

Paper ID
7661
Venue
SIGMOD
Year
2026
Pagerank
5.093636e-05
Overall Rank
10,448 | 28.32%
DOI
10.1145/3786644

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{sun_sigmod26,
        title = {{Efficient Influential Community Search over Dynamic Graphs}},
        author = {Sun, Youran and Zhou, Yingli and Fang, Yixiang and Chen, Cheng and Hu, Yongmin and Hu, Yingqian},
        series = {{SIGMOD} '26},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3786644},
        url = {https://dl.acm.org/doi/10.1145/3786644},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 30 of 30 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
61 Maintaining Views Incrementally 1993 SIGMOD 0.00039026867
189 Querying K-Truss Community in Large and Dynamic Graphs 2014 SIGMOD 0.00026114928
273 Online Search of Overlapping Communities 2013 SIGMOD 0.00022671795
276 Local Search of Communities in Large Graphs 2014 SIGMOD 0.00022620623
375 Incremental Maintenance of Views with Duplicates 1995 SIGMOD 0.00019681204
636 Answering Conjunctive Queries under Updates 2017 PODS 0.0001551856
706 Effective Community Search for Large Attributed Graphs 2016 VLDB 0.00014789612
982 Influential Community Search in Large Networks 2015 VLDB 0.0001283311
1,113 Approximate Closest Community Search in Networks 2016 VLDB 0.00012124571
1,239 Attribute-Driven Community Search 2017 VLDB 0.000115381
1,640 Distance-generalized Core Decomposition 2019 SIGMOD 0.00010153865
1,647 Effective and Efficient Community Search over Large Heterogeneous Information Networks 2020 VLDB 0.00010125633
2,106 Maximum Co-located Community Search in Large Scale Social Networks 2018 VLDB 9.1568079e-05
2,243 Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs 2019 SIGMOD 8.8813183e-05
2,482 Efficient Structural Graph Clustering: An Index-Based Approach 2018 VLDB 8.5183361e-05
2,798 Incremental Graph Computations: Doable and Undoable 2017 SIGMOD 8.1129891e-05
2,826 Hierarchical Core Maintenance on Large Dynamic Graphs 2021 VLDB 8.0865974e-05
3,151 Relation Strength-Aware Clustering of Heterogeneous Information Networks with Incomplete Attributes 2012 VLDB 7.7036411e-05
3,206 Incremental View Maintenance with Triple Lock Factorization Benefits 2018 SIGMOD 7.6367549e-05
3,254 Skyline Community Search in Multi-valued Networks 2018 SIGMOD 7.5928992e-05
3,261 Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity 2015 SIGMOD 7.5853837e-05
4,358 Parallel Index-Based Structural Graph Clustering and Its Approximation 2021 SIGMOD 6.7459836e-05
4,423 Dynamic Structural Clustering on Graphs 2021 SIGMOD 6.7107949e-05
4,681 Influential Community Search over Large Heterogeneous Information Networks 2023 VLDB 6.5665144e-05
5,149 An Optimal and Progressive Approach to Online Search of Top-K Influential Communities 2018 VLDB 6.3459884e-05
7,141 Effective Indexing for Dynamic Structural Graph Clustering 2022 VLDB 5.6920203e-05
8,019 Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks 2024 VLDB 5.5062157e-05
8,991 Truss-based Community Search over Streaming Directed Graphs 2024 VLDB 5.3377754e-05
9,444 An Efficient Algorithm for Distance-based Structural Graph Clustering 2023 SIGMOD 5.2675506e-05
9,519 A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery 2024 SIGMOD 5.2562724e-05
Previous Page 1 / 1 Next

Semantically Similar Papers