Image de couverture de livre

Beyond BFS: A Comparative Study of Rooted Spanning Tree Algorithms on GPUs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Sahu, Abhijeet, Donur, Srikar Vilas
Format:	Preprint
Publié:	2026
Sujets:	Distributed, Parallel, and Cluster Computing Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Parallel Cluster-BFS and Applications to Shortest Paths
par: Wang, Letong, et autres
Publié: (2024)

BLEST: Blazingly Efficient BFS using Tensor Cores
par: Elbek, Deniz, et autres
Publié: (2025)

Engineering A Workload-balanced Push-Relabel Algorithm for Massive Graphs on GPUs
par: Hsieh, Chou-Ying, et autres
Publié: (2024)

Fast Spanning Tree Sampling in Broadcast Congested Clique
par: Anari, Nima, et autres
Publié: (2026)

Energy-Efficient Aggregation and Minimum-Degree Spanning Trees in Radio Networks
par: Chang, Yi-Jun, et autres
Publié: (2026)

Efficient Dynamic MaxFlow Computation on GPUs
par: Kannappan, Shruthi, et autres
Publié: (2025)

GPU-RMQ: Accelerating Range Minimum Queries on Modern GPUs
par: Kreis, Lara, et autres
Publié: (2026)

Distributed Stochastic Graph Algorithms
par: Censor-Hillel, Keren, et autres
Publié: (2026)

A Fault-Tolerant Version of Safra's Termination Detection Algorithm
par: Fokkink, Wan, et autres
Publié: (2026)

DAG-Inducing Problems and Algorithms
par: Gupta, Arya Tanmay, et autres
Publié: (2023)

Eventually Lattice-Linear Algorithms
par: Gupta, Arya Tanmay, et autres
Publié: (2023)

Distributed Graph Algorithms with Predictions
par: Boyar, Joan, et autres
Publié: (2025)

A Parallel Scan Algorithm in the Tensor Core Unit Model
par: Zouzias, Anastasios, et autres
Publié: (2024)

A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems
par: Li, Qian, et autres
Publié: (2024)

A $(3+\varepsilon)$-Approximate Correlation Clustering Algorithm in Dynamic Streams
par: Cambus, Mélanie, et autres
Publié: (2022)

Parallel Algorithms for Hierarchical Nucleus Decomposition
par: Shi, Jessica, et autres
Publié: (2023)

Encoding Schemes for Parallel In-Place Algorithms
par: Hutton, Chase, et autres
Publié: (2025)

Sorting in One and Two Rounds using $t$-Comparators
par: Gelles, Ran, et autres
Publié: (2024)

BinomialHash: A Constant Time, Minimal Memory Consistent Hash Algorithm
par: Coluzzi, Massimo, et autres
Publié: (2024)

Message Optimality and Message-Time Trade-offs for APSP and Beyond
par: Dufoulon, Fabien, et autres
Publié: (2025)

Massively Parallel Algorithms for Approximate Shortest Paths
par: Dory, Michal, et autres
Publié: (2024)

PASGAL: Parallel And Scalable Graph Algorithm Library
par: Dong, Xiaojun, et autres
Publié: (2024)

Strong Linearizability without Compare&Swap: The Case of Bags
par: Ellen, Faith, et autres
Publié: (2024)

A Simple $(1-ε)$-Approximation Semi-Streaming Algorithm for Maximum (Weighted) Matching
par: Assadi, Sepehr
Publié: (2023)

Two Efficient Message-passing Exclusive Scan Algorithms
par: Träff, Jesper Larsson
Publié: (2026)

Designing Parallel Algorithms for Community Detection using Arachne
par: Li, Fuhuan, et autres
Publié: (2025)

Almost Optimal Algorithms for Token Collision in Anonymous Networks
par: Bai, Sirui, et autres
Publié: (2024)

Parallel Algorithms for the One Sided Crossing Minimization Problem
par: Popa, Bogdan-Ioan, et autres
Publié: (2025)

Fully Scalable MPC Algorithms for Euclidean k-Center
par: Czumaj, Artur, et autres
Publié: (2025)

Fully Scalable MPC Algorithms for Clustering in High Dimension
par: Czumaj, Artur, et autres
Publié: (2023)

Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering
par: De Man, Quinten, et autres
Publié: (2025)

Fast and Space-Efficient Parallel Algorithms for Influence Maximization
par: Wang, Letong, et autres
Publié: (2023)

Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering
par: Dhulipala, Laxman, et autres
Publié: (2024)

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation
par: Blelloch, Guy, et autres
Publié: (2026)

Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs
par: Blin, Lelia, et autres
Publié: (2026)

Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications
par: Chang, Yi-Jun
Publié: (2023)

Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs
par: Bonamy, Marthe, et autres
Publié: (2025)

DiaQ: Efficient State-Vector Quantum Simulation
par: Chundury, Srikar, et autres
Publié: (2024)

The Online Pause and Resume Problem: Optimal Algorithms and An Application to Carbon-Aware Load Shifting
par: Lechowicz, Adam, et autres
Publié: (2023)

Can Like Attract Like? A Study of Homonymous Gathering in Networks
par: Devismes, Stéphane, et autres
Publié: (2025)