• DOI:10.4230/LIPIcs.ESA.2020.2
Corpus ID: 218674442

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}
}

• Umut A. Acar, D. Anderson, +2 authors Sam Westrick
• Published in ESA 2020
• Computer Science, Mathematics

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

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed