Parallel Batch-Dynamic Trees via Change Propagation

@inproceedings{Acar2020ParallelBT,
  title={Parallel Batch-Dynamic Trees via Change Propagation},
  author={Umut A. Acar and D. Anderson and G. Blelloch and L. Dhulipala and Sam Westrick},
  booktitle={ESA},
  year={2020}
}
The dynamic trees problem is to maintain a forest subject to edge insertions and deletions while facilitating queries such as connectivity, path weights, and subtree weights. Dynamic trees are a fundamental building block of a large number of graph algorithms. Although traditionally studied in the single-update setting, dynamic algorithms capable of supporting batches of updates are increasingly relevant today due to the emergence of rapidly evolving dynamic datasets. Since processing updates… Expand
2 Citations

Figures and Tables from this paper

Work-Efficient Batch-Incremental Minimum Spanning Trees with Applications to the Sliding-Window Model
  • 3
  • PDF
Parallel Minimum Cuts in O(m log2(n)) Work and Low Depth
  • 1
  • PDF

References

SHOWING 1-10 OF 54 REFERENCES
Batch-Parallel Euler Tour Trees
  • 14
  • PDF
Dynamic Parallel Tree Contraction
  • 5
  • PDF
Parallel Batch-Dynamic Graph Connectivity
  • 18
  • PDF
Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds
  • 15
  • PDF
Self-adjusting top trees
  • 51
  • PDF
Batch Dynamic Algorithms for Two Graph Problems
  • 13
A data structure for dynamic trees
  • 845
  • PDF
...
1
2
3
4
5
...