Brief Announcement: Parallel Dynamic Tree Contraction via Self-Adjusting Computation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

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.
Fichier principal
Vignette du fichier
main.pdf (544.86 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01664903 , version 1 (15-12-2017)

Identifiers

Cite

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⟩

Collections

INRIA INRIA2
71 View
187 Download

Altmetric

Share

Gmail Facebook X LinkedIn More