On Querying Connected Components in Large Temporal Graphs
Summary: Window-CC: a relaxed temporal connected-component model in a fixed time window for both undirected and directed temporal graphs. Online vs index-based queries; optimized indices deliver up to 3x (undirected) and up to 100x (directed) speedups with substantially smaller space than baselines. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Haoxuan Xie
- 2. Yixiang Fang
- 3. Yuyang Xia
- 4. Wensheng Luo
- 5. Chenhao Ma
Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,657 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD | 4.9720132e-05 |
| 7,576 | Querying Structural Diversity in Streaming Graphs | 2024 | VLDB | 4.7064285e-05 |
| 10,232 | Efficient Temporal Subgraph Management: A New Interval Index | 2026 | VLDB | 4.1945683e-05 |
| 10,240 | Effective Durable Community Search in Large Temporal Graph | 2026 | VLDB | 4.1945683e-05 |
| 10,397 | Bursting Flow Query on Large Temporal Flow Networks | 2025 | SIGMOD | 4.1945683e-05 |
| 10,467 | Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs | 2025 | SIGMOD | 4.1945683e-05 |
| 10,547 | On More Efficiently and Versatilely Querying Historical k-Cores | 2025 | VLDB | 4.1945683e-05 |
| 10,563 | Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index | 2025 | VLDB | 4.1945683e-05 |
| 11,044 | Evolution Forest Index: Towards Optimal Temporal k-Core Component Search via Time-Topology Isomorphic Computation | 2024 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 508 | Dynamic Query Evaluation Plans | 1989 | SIGMOD | 0.00021463742 |
| 1,024 | Path Problems in Temporal Graphs | 2014 | VLDB | 0.00014609643 |
| 1,394 | Real-time Constrained Cycle Detection in Large Dynamic Graphs | 2018 | VLDB | 0.0001221552 |
| 2,336 | Optimizing Graph Algorithms on Pregel-like Systems | 2014 | VLDB | 9.0109891e-05 |
| 2,927 | Pregel Algorithms for Graph Connectivity Problems with Performance Guarantees | 2014 | VLDB | 7.8823626e-05 |
| 3,129 | Scalable Big Graph Processing in MapReduce | 2014 | SIGMOD | 7.5008242e-05 |
| 3,987 | COMMIT: A Scalable Approach to Mining Communication Motifs from Dynamic Networks | 2015 | SIGMOD | 6.5605514e-05 |
| 4,139 | On Querying Historical K-Cores | 2021 | VLDB | 6.415046e-05 |
| 7,769 | GraphZeppelin: Storage-Friendly Sketching for Connected Components on Dynamic Graph Streams | 2022 | SIGMOD | 4.6562896e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,627 | Incremental Sliding Window Connectivity over Streaming Graphs | 2024 | VLDB | 4.6928167e-05 |
| 4,139 | On Querying Historical K-Cores | 2021 | VLDB | 6.415046e-05 |
| 10,985 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD | 4.1945683e-05 |
| 3,854 | Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity | 2015 | SIGMOD | 6.6988744e-05 |
| 5,540 | Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs | 2021 | VLDB | 5.4498271e-05 |
| 7,341 | Scalable Time-Range k-Core Query on Temporal Graphs | 2023 | VLDB | 4.7576413e-05 |
| 9,228 | Efficiently Counting Triangles in Large Temporal Graphs | 2025 | SIGMOD | 4.3690661e-05 |
| 10,240 | Effective Durable Community Search in Large Temporal Graph | 2026 | VLDB | 4.1945683e-05 |
| 11,042 | Efficient Index for Temporal Core Queries over Bipartite Graphs | 2024 | VLDB | 4.1945683e-05 |
| 6,657 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD | 4.9720132e-05 |