Concurrent Link-Cut Trees
Summary: Explores parallelizing link-cut trees to maintain a dynamic forest under concurrent link and cut operations. It uses path decomposition to store root-to-node paths in binary balanced trees, achieving logarithmic time and enabling scalable parallel root, link, and cut queries. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Mihail Stoian (Technical University of Munich)
BibTeX Citation
@inproceedings{stoian_sigmod22,
title = {{Concurrent Link-Cut Trees}},
author = {Stoian, Mihail},
series = {{SIGMOD} '22},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3514221.3520247},
url = {https://dl.acm.org/doi/10.1145/3514221.3520247},
year = {2022}
}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 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,387 | Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs | 2024 | VLDB |
| 2 | 8,657 | An Experimental Comparison of Tree-data Structures for Connectivity Queries on Fully-dynamic Undirected Graphs | 2025 | SIGMOD |
| 3 | 7,862 | ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms | 2021 | VLDB |
| 4 | 11,132 | Topology-aware Parallel Joins | 2024 | PODS |
| 5 | 3,154 | Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected Graphs | 2022 | VLDB |
| 6 | 7,710 | Mining Tree-Structured Data on Multicore Systems | 2009 | VLDB |
| 7 | 3,057 | High-Concurrency Locking in R-Trees | 1995 | VLDB |
| 8 | 11,198 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD |
| 9 | 4,783 | Concurrency Control Mechanisms and the Serializability of Concurrent Tree Algorithms | 1984 | PODS |
| 10 | 11,105 | Towards Scalable and Practical Batch-Dynamic Connectivity | 2025 | VLDB |