Improved Worst-Case Deterministic Parallel Dynamic Minimum Spanning Forest

Summary

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Tsvi Kopelowitz, Ely Porat, Yair Rosenmutter

Journal title: Proceeding SPAA '18 Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures

Journal publisher: ACM

Published year: 2018

Published pages: 333-341

DOI identifier: 10.1145/3210377.3210403

ISBN: 978-1-4503-5799-9