Maintaining Biconnected Components in Streaming Graphs
Summary: An index compresses BCCs across sliding-window subwindows, avoiding explicit deletion maintenance and discarding expired-edge regions in O(1) time. Insertions progressively update the index via tree-edge rotations, achieving optimal space and strong empirical speedups. (summarized by gpt-5.6-luna on Jul 26 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Zhao Lu (University of New South Wales)
- 2. Dong Wen (University of New South Wales)
- 3. Wentao Li (University of Leicester)
- 4. Xuemin Lin (Shanghai Jiao Tong University)
- 5. Wenjie Zhang (University of New South Wales)
BibTeX Citation
@inproceedings{lu_sigmod26,
title = {{Maintaining Biconnected Components in Streaming Graphs}},
author = {Lu, Zhao and Wen, Dong and Li, Wentao and Lin, Xuemin and Zhang, Wenjie},
series = {{SIGMOD} '26},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3802084},
url = {https://dl.acm.org/doi/10.1145/3802084},
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 19 of 19 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,198 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD |
| 2 | 10,283 | Querying Cohesive Subgraphs in Temporal Graphs | 2026 | SIGMOD |
| 3 | 10,423 | A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs | 2026 | SIGMOD |
| 4 | 9,872 | TC-Match: Fast Time-constrained Continuous Subgraph Matching | 2024 | VLDB |
| 5 | 8,149 | Efficient Index for Temporal Core Queries over Bipartite Graphs | 2024 | VLDB |
| 6 | 10,478 | Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs | 2026 | SIGMOD |
| 7 | 3,261 | Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity | 2015 | SIGMOD |
| 8 | 6,075 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD |
| 9 | 3,836 | On Querying Connected Components in Large Temporal Graphs | 2023 | SIGMOD |
| 10 | 6,868 | Incremental Sliding Window Connectivity over Streaming Graphs | 2024 | VLDB |