DBScholar

Back to papers

Constant-time Connectivity Querying in Dynamic Graphs

Summary: Constant-time connectivity queries for fully dynamic undirected graphs using a novel hybrid of per-component spanning trees and a disjoint-set (DS) tree. Concurrent maintenance of both trees yields true constant query time and significantly improved edge insert/delete times, outperforming the D-tree on real datasets. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
7041
Venue
SIGMOD
Year
2024
Pagerank
5.093636e-05
Overall Rank
11,198 | 23.18%
DOI
10.1145/3698805

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{xu_sigmod24,
        title = {{Constant-time Connectivity Querying in Dynamic Graphs}},
        author = {Xu, Lantian and Wen, Dong and Qin, Lu and Li, Ronghua and Zhang, Ying and Lin, Xuemin},
        series = {{SIGMOD} '24},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3698805},
        url = {https://dl.acm.org/doi/10.1145/3698805},
        year = {2024}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
10,266 Maintaining Biconnected Components in Streaming Graphs 2026 SIGMOD 5.093636e-05
10,671 Minimum Spanning Tree Maintenance in Dynamic Graphs 2025 SIGMOD 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 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