Improved worst-case deterministic parallel dynamic minimum spanning forest

Tsvi Kopelowitz, Ely Porat, Yair Rosenmutter

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

This paper gives a new deterministic algorithm for the dynamic Minimum Spanning Forest (MSF) problem in the EREW PRAM model, where the goal is to maintain a MSF of a weighted graph with n vertices and m edges while supporting edge insertions and deletions. We show that one can solve the dynamic MSF problem using O(n) processors and O(log n) worst-case update time, for a total of O(n log n) work. This improves on the work of Ferragina [IPPS 1995] which costs O(log n) worst-case update time and O(n2/3 log m n ) work.

Original languageEnglish
Title of host publicationSPAA 2018 - Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures
PublisherAssociation for Computing Machinery
Pages333-341
Number of pages9
ISBN (Electronic)9781450357999
DOIs
StatePublished - 11 Jul 2018
Event30th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2018 - Vienna, Austria
Duration: 16 Jul 201818 Jul 2018

Publication series

NameAnnual ACM Symposium on Parallelism in Algorithms and Architectures

Conference

Conference30th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2018
Country/TerritoryAustria
CityVienna
Period16/07/1818/07/18

Bibliographical note

Publisher Copyright:
© 2018 Association for Computing Machinery.

Fingerprint

Dive into the research topics of 'Improved worst-case deterministic parallel dynamic minimum spanning forest'. Together they form a unique fingerprint.

Cite this