Imagen de Portada

Massively Parallel Algorithms for Approximate Shortest Paths

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Dory, Michal, Matar, Shaked
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms Distributed, Parallel, and Cluster Computing
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Improved All-Pairs Approximate Shortest Paths in Congested Clique
por: Bui, Hong Duc, et al.
Publicado: (2024)

Parallel Cluster-BFS and Applications to Shortest Paths
por: Wang, Letong, et al.
Publicado: (2024)

Parallel Point-to-Point Shortest Paths and Batch Queries
por: Dong, Xiaojun, et al.
Publicado: (2025)

Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights
por: Ashvinkumar, Vikrant, et al.
Publicado: (2023)

A Simple Distributed Deterministic Planar Separator
por: Abd-Elhaleem, Yaseen, et al.
Publicado: (2026)

Distributed Maximum Flow in Planar Graphs
por: Abd-Elhaleem, Yaseen, et al.
Publicado: (2024)

Fast Broadcast in Highly Connected Networks
por: Chandra, Shashwat, et al.
Publicado: (2024)

Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model
por: Chang, Yi-Jun, et al.
Publicado: (2023)

Massively Parallel Maximum Coverage Revisited
por: Bui, Thai, et al.
Publicado: (2024)

Massively Parallel Ruling Set Made Deterministic
por: Giliberti, Jeff, et al.
Publicado: (2024)

Adaptive Massively Parallel Coloring in Sparse Graphs
por: Latypov, Rustam, et al.
Publicado: (2024)

Improved Massively Parallel Triangle Counting in $O(1)$ Rounds
por: Liu, Quanquan C., et al.
Publicado: (2024)

Parallel Algorithms for Hierarchical Nucleus Decomposition
por: Shi, Jessica, et al.
Publicado: (2023)

Encoding Schemes for Parallel In-Place Algorithms
por: Hutton, Chase, et al.
Publicado: (2025)

PASGAL: Parallel And Scalable Graph Algorithm Library
por: Dong, Xiaojun, et al.
Publicado: (2024)

OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths
por: Gold, Leo, et al.
Publicado: (2024)

Designing Parallel Algorithms for Community Detection using Arachne
por: Li, Fuhuan, et al.
Publicado: (2025)

Parallel Algorithms for the One Sided Crossing Minimization Problem
por: Popa, Bogdan-Ioan, et al.
Publicado: (2025)

Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering
por: De Man, Quinten, et al.
Publicado: (2025)

Fast and Space-Efficient Parallel Algorithms for Influence Maximization
por: Wang, Letong, et al.
Publicado: (2023)

A Parallel Scan Algorithm in the Tensor Core Unit Model
por: Zouzias, Anastasios, et al.
Publicado: (2024)

Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering
por: Dhulipala, Laxman, et al.
Publicado: (2024)

Engineering A Workload-balanced Push-Relabel Algorithm for Massive Graphs on GPUs
por: Hsieh, Chou-Ying, et al.
Publicado: (2024)

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation
por: Blelloch, Guy, et al.
Publicado: (2026)

A $(3+\varepsilon)$-Approximate Correlation Clustering Algorithm in Dynamic Streams
por: Cambus, Mélanie, et al.
Publicado: (2022)

Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs
por: Bonamy, Marthe, et al.
Publicado: (2025)

Parallelizing the Approximate Minimum Degree Ordering Algorithm: Strategies and Evaluation
por: Chang, Yen-Hsiang, et al.
Publicado: (2025)

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

Parallel Dynamic Maximal Matching
por: Ghaffari, Mohsen, et al.
Publicado: (2024)

Parallel Integer Sort: Theory and Practice
por: Dong, Xiaojun, et al.
Publicado: (2024)

Parallel Scan on Ascend AI Accelerators
por: Wróblewski, Bartłomiej, et al.
Publicado: (2025)

Optimal Distributed Replacement Paths
por: Chang, Yi-Jun, et al.
Publicado: (2025)

Parallel Contraction Hierarchies Can Be Efficient and Scalable
por: Wan, Zijin, et al.
Publicado: (2024)

Parallel and (Nearly) Work-Efficient Dynamic Programming
por: Ding, Xiangyun, et al.
Publicado: (2024)

Parallel Batch-Dynamic Maximal Independent Set
por: Blelloch, Guy, et al.
Publicado: (2026)

Parallel $k$-Core Decomposition: Theory and Practice
por: Liu, Youzhe, et al.
Publicado: (2025)

Exploiting Multi-Core Parallelism in Blockchain Validation and Construction
por: Karmegam, Arivarasan, et al.
Publicado: (2026)

Paralleling and Accelerating Arc Consistency Enforcement with Recurrent Tensor Computations
por: Yang, Mingqi
Publicado: (2024)

Parallel $k$-Core Decomposition with Batched Updates and Asynchronous Reads
por: Liu, Quanquan C., et al.
Publicado: (2024)

Enhancing Scalability and Performance in Influence Maximization with Optimized Parallel Processing
por: Wu, Hanjiang, et al.
Publicado: (2024)