Work-Efficient Batch-Incremental Minimum Spanning Trees with Applications to the Sliding-Window Model

Daniel Anderson, Guy E. Blelloch, Kanat Tangwongsan. Work-Efficient Batch-Incremental Minimum Spanning Trees with Applications to the Sliding-Window Model. In Christian Scheideler, Michael Spear, editors, SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020. pages 51-61, ACM, 2020. [doi]

Abstract

Abstract is missing.