Open access
May 2026
Fully Dynamic Rooted Spanning Tree on GPU
This paper presents four novel fully dynamic parallel algorithms to update the spanning forest without reconstructing it from scratch when a batch of edges are inserted or deleted.
Abhijeet Sahu, Harmit Singh, Soham Nandy et al.
· IEEE International Symposium... · 0 citations