Skip to Main content Skip to Navigation
Conference papers

Brief Announcement: Parallel Dynamic Tree Contraction via Self-Adjusting Computation

Abstract : Dynamic algorithms are used to compute a property of some data while the data undergoes changes over time. Many dynamic algorithms have been proposed but nearly all are sequential. In this paper, we present our ongoing work on designing a parallel algorithm for the dynamic trees problem, which requires computing a property of a forest as the forest undergoes changes. Our algorithm allows insertion and/or deletion of both vertices and edges anywhere in the input and performs updates in parallel. We obtain our algorithm by applying a dynamization technique called self-adjusting computation to the classic algorithm of Miller and Reif for tree contraction.
Complete list of metadata

Cited literature [42 references]  Display  Hide  Download
Contributor : Vitalii Aksenov Connect in order to contact the contributor
Submitted on : Friday, December 15, 2017 - 12:31:35 PM
Last modification on : Wednesday, June 8, 2022 - 12:50:04 PM


Files produced by the author(s)




Umut A. Acar, Vitalii Aksenov, Sam Westrick. Brief Announcement: Parallel Dynamic Tree Contraction via Self-Adjusting Computation. The 29th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '17), Jul 2017, Washington, United States. ⟨10.1145/3087556.3087595⟩. ⟨hal-01664903⟩



Record views


Files downloads