Showing cs.DCShow all
2 papers · 1 filter
cs.DC2026
Fully Dynamic Rooted Spanning Tree on GPU
Abhijeet Sahu, Harmit Singh, Soham Nandy +1
Spanning trees are fundamental structures in graph theory, essential for various applications such as network maintenance, routing adjustments, and many more. The dynamic nature of…
cs.DC2026
Beyond BFS: A Comparative Study of Rooted Spanning Tree Algorithms on GPUs
Abhijeet Sahu, Srikar Vilas Donur
Rooted spanning trees (RSTs) are a core primitive in parallel graph analytics, underpinning algorithms such as biconnected components and planarity testing. On GPUs, RST constructi…