DBScholar

Back to papers

Querying Cohesive Subgraphs in Temporal Graphs

Summary: Introduces a unified index for historical cohesive-subgraph queries over non-overlapping, monotonic CSMs, rather than model-specific structures. Reduces His-CC and His-Core to a canonical spanning-connected-component query, yielding up to 60×/100× speedups. (summarized by gpt-5.6-luna on Jul 26 2026)

Paper ID
h021593bbef5c02bd
Venue
SIGMOD
Year
2026
Pagerank
4.9769913e-05
Overall Rank
10,506 | 29.39%
DOI
10.1145/3802103
PDF
Download (CC BY 4.0)

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{liu_sigmod26,
        title = {{Querying Cohesive Subgraphs in Temporal Graphs}},
        author = {Liu, Yinyu and Yu, Kaiqiang and Liu, Shengxin and Long, Cheng and Zhou, Xun},
        series = {{SIGMOD} '26},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3802103},
        url = {https://dl.acm.org/doi/10.1145/3802103},
        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 24 of 24 cited papers.

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

Rank Cited Paper Year Venue Pagerank
100 Truss Decomposition in Massive Networks 2012 VLDB 0.0003396253
184 Querying K-Truss Community in Large and Dynamic Graphs 2014 SIGMOD 0.00026097449
834 K-Core Decomposition of Large Networks on a Single PC 2016 VLDB 0.00013576778
1,106 Path Problems in Temporal Graphs 2014 VLDB 0.0001199079
3,190 Efficient Maximum k-Plex Computation over Large Sparse Graphs 2023 VLDB 7.5493022e-05
3,251 On Querying Historical K-Cores 2021 VLDB 7.4903737e-05
3,376 Mining Bursting Core in Large Temporal Graphs 2022 VLDB 7.3556068e-05
3,498 COMMIT: A Scalable Approach to Mining Communication Motifs from Dynamic Networks 2015 SIGMOD 7.2516799e-05
3,662 On Querying Historical Evolving Graph Sequences 2011 VLDB 7.1164957e-05
3,861 Efficient Maximum k-Defective Clique Computation with Improved Time Complexity 2023 SIGMOD 6.9630685e-05
3,922 On Querying Connected Components in Large Temporal Graphs 2023 SIGMOD 6.9205122e-05
4,527 Maximal Defective Clique Enumeration 2023 SIGMOD 6.557512e-05
5,549 Reliable Community Search in Dynamic Networks 2022 VLDB 6.0854158e-05
5,554 Theoretically and Practically Efficient Maximum Defective Clique Search 2024 SIGMOD 6.0831622e-05
5,586 Maximum k-Plex Computation: Theory and Practice 2024 SIGMOD 6.0732255e-05
6,205 On Querying Historical Connectivity in Temporal Graphs 2024 SIGMOD 5.8483206e-05
6,292 QTCS: Efficient Query-Centered Temporal Community Search 2024 VLDB 5.8197041e-05
6,772 Scalable Time-Range k-Core Query on Temporal Graphs 2023 VLDB 5.6842741e-05
7,044 Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach 2023 SIGMOD 5.6114645e-05
7,077 Querying Structural Diversity in Streaming Graphs 2024 VLDB 5.6034826e-05
8,324 Efficient Index for Temporal Core Queries over Bipartite Graphs 2024 VLDB 5.3530306e-05
8,889 Evolution Forest Index: Towards Optimal Temporal k-Core Component Search via Time-Topology Isomorphic Computation 2024 VLDB 5.2542808e-05
8,987 On More Efficiently and Versatilely Querying Historical k-Cores 2025 VLDB 5.2424308e-05
10,106 Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index 2025 VLDB 5.0765311e-05
Previous Page 1 / 1 Next

Semantically Similar Papers