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 language | English |
|---|---|
| Title of host publication | SPAA 2018 - Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures |
| Publisher | Association for Computing Machinery |
| Pages | 333-341 |
| Number of pages | 9 |
| ISBN (Electronic) | 9781450357999 |
| DOIs | |
| State | Published - 11 Jul 2018 |
| Event | 30th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2018 - Vienna, Austria Duration: 16 Jul 2018 → 18 Jul 2018 |
Publication series
| Name | Annual ACM Symposium on Parallelism in Algorithms and Architectures |
|---|
Conference
| Conference | 30th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2018 |
|---|---|
| Country/Territory | Austria |
| City | Vienna |
| Period | 16/07/18 → 18/07/18 |
Bibliographical note
Publisher Copyright:© 2018 Association for Computing Machinery.
Funding
This work is supported in part by ISF grant 1278/16. This project has received funding from the European Research Council (ERC) under the European Union Horizon 2020 research and innovation programme (grant agreement No 683064).
| Funders | Funder number |
|---|---|
| Horizon 2020 Framework Programme | 683064 |
| H2020 European Research Council | |
| European Geosciences Union | 2020 |
| Israel Science Foundation | 1278/16. |