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 10 of 10 citing papers.
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 |
|---|---|---|---|---|
| 509 | Dynamic Query Evaluation Plans | 1989 | SIGMOD | 0.00021463676 |
| 1,021 | Path Problems in Temporal Graphs | 2014 | VLDB | 0.00014608331 |
| 1,392 | Real-time Constrained Cycle Detection in Large Dynamic Graphs | 2018 | VLDB | 0.00012224015 |
| 2,332 | Optimizing Graph Algorithms on Pregel-like Systems | 2014 | VLDB | 9.0173968e-05 |
| 2,916 | Pregel Algorithms for Graph Connectivity Problems with Performance Guarantees | 2014 | VLDB | 7.9062736e-05 |
| 3,188 | Scalable Big Graph Processing in MapReduce | 2014 | SIGMOD | 7.4142307e-05 |
| 3,950 | COMMIT: A Scalable Approach to Mining Communication Motifs from Dynamic Networks | 2015 | SIGMOD | 6.5925643e-05 |
| 4,133 | On Querying Historical K-Cores | 2021 | VLDB | 6.4185206e-05 |
| 7,729 | GraphZeppelin: Storage-Friendly Sketching for Connected Components on Dynamic Graph Streams | 2022 | SIGMOD | 4.6614672e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,629 | Incremental Sliding Window Connectivity over Streaming Graphs | 2024 | VLDB | 4.6883161e-05 |
| 4,133 | On Querying Historical K-Cores | 2021 | VLDB | 6.4185206e-05 |
| 10,988 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD | 4.1905499e-05 |
| 3,857 | Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity | 2015 | SIGMOD | 6.6924202e-05 |
| 5,548 | Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs | 2021 | VLDB | 5.4445937e-05 |
| 7,339 | Scalable Time-Range k-Core Query on Temporal Graphs | 2023 | VLDB | 4.7530782e-05 |
| 9,231 | Efficiently Counting Triangles in Large Temporal Graphs | 2025 | SIGMOD | 4.3648789e-05 |
| 10,240 | Effective Durable Community Search in Large Temporal Graph | 2026 | VLDB | 4.1905499e-05 |
| 11,045 | Efficient Index for Temporal Core Queries over Bipartite Graphs | 2024 | VLDB | 4.1905499e-05 |
| 6,660 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD | 4.9672425e-05 |