Imagen de Portada

Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Ashvinkumar, Vikrant, Bernstein, Aaron, Cao, Nairen, Grunau, Christoph, Haeupler, Bernhard, Jiang, Yonggang, Nanongkai, Danupon, Su, Hsin Hao
Formato:	Preprint
Publicado:	2023
Materias:	Distributed, Parallel, and Cluster Computing Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

SSSP-Del: Fully Dynamic Distributed Algorithm for Single-Source Shortest Path
por: Javanrood, Parshan, et al.
Publicado: (2025)

Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set
por: Ghaffari, Mohsen, et al.
Publicado: (2025)

Negative-Weight Single-Source Shortest Paths in Near-linear Time
por: Bernstein, Aaron, et al.
Publicado: (2022)

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

Massively Parallel Algorithms for Approximate Shortest Paths
por: Dory, Michal, et al.
Publicado: (2024)

A Heuristic Algorithm for Shortest Path Search
por: Yu, Huashan, et al.
Publicado: (2025)

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

Min-Max Correlation Clustering via Neighborhood Similarity
por: Cao, Nairen, et al.
Publicado: (2025)

Polylog-Competitive Deterministic Local Routing and Scheduling
por: Haeupler, Bernhard, et al.
Publicado: (2024)

Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter
por: Padalkin, Andreas, et al.
Publicado: (2024)

Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS
por: Ghaffari, Mohsen, et al.
Publicado: (2024)

DAWN: Matrix Operation-Optimized Algorithm for Shortest Paths Problem on Unweighted Graphs
por: Feng, Yelai, et al.
Publicado: (2022)

Distributed Q-learning-based Shortest-Path Tree Construction in IoT Sensor Networks
por: Vo, Van-Vi, et al.
Publicado: (2025)

Enhanced OpenMP Algorithm to Compute All-Pairs Shortest Path on x86 Architectures
por: Calderón, Sergio, et al.
Publicado: (2024)

A Cut-Matching Game for Constant-Hop Expanders
por: Haeupler, Bernhard, et al.
Publicado: (2022)

SPPO:Efficient Long-sequence LLM Training via Adaptive Sequence Pipeline Parallel Offloading
por: Chen, Qiaoling, et al.
Publicado: (2025)

Resource-efficient Parallel Split Learning in Heterogeneous Edge Computing
por: Zhang, Mingjin, et al.
Publicado: (2024)

Deterministic Distributed Algorithms and Measurable Combinatorics on $Δ$-Regular Forests
por: Brandt, Sebastian, et al.
Publicado: (2022)

The Complexity of Distributed Minimum Weight Cycle Approximation
por: Chang, Yi-Jun, et al.
Publicado: (2026)

WOC: Dual-Path Weighted Object Consensus Made Efficient
por: Fonseca, Tanisha, et al.
Publicado: (2025)

Ghidorah: Fast LLM Inference on Edge with Speculative Decoding and Hetero-Core Parallelism
por: Wei, Jinhui, et al.
Publicado: (2025)

Communication-Computation Pipeline Parallel Split Learning over Wireless Edge Networks
por: Liu, Chenyu, et al.
Publicado: (2025)

A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem
por: Alkhalifa, Rabab, et al.
Publicado: (2025)

Parallel Collaborative ADMM Privacy Computing and Adaptive GPU Acceleration for Distributed Edge Networks
por: Xia, Mengchun, et al.
Publicado: (2026)

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

Heimdall++: Optimizing GPU Utilization and Pipeline Parallelism for Efficient Single-Pulse Detection
por: Xia, Bingzheng, et al.
Publicado: (2025)

LoongTrain: Efficient Training of Long-Sequence LLMs with Head-Context Parallelism
por: Gu, Diandian, et al.
Publicado: (2024)

On Homomorphism Graphs
por: Brandt, Sebastian, et al.
Publicado: (2021)

InternEvo: Efficient Long-sequence Large Language Model Training via Hybrid Parallelism and Redundant Sharding
por: Chen, Qiaoling, et al.
Publicado: (2024)

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

Exact, Efficient, and Reliable Multi-Objective and Multi-Constrained IoT Workflow Scheduling in Edge-Hub-Cloud Cyber-Physical Systems
por: Kouloumpris, Andreas, et al.
Publicado: (2026)

Cppless: Single-Source and High-Performance Serverless Programming in C++
por: Copik, Marcin, et al.
Publicado: (2024)

RAPID-Graph: Recursive All-Pairs Shortest Paths Using Processing-in-Memory for Dynamic Programming on Graphs
por: Chen, Yanru, et al.
Publicado: (2025)

Edge-Parallel Graph Encoder Embedding
por: Lubonja, Ariel, et al.
Publicado: (2024)

Balancing Pipeline Parallelism with Vocabulary Parallelism
por: Yeung, Man Tsung, et al.
Publicado: (2024)

Distributed Path Compression for Piecewise Linear Morse-Smale Segmentations and Connected Components
por: Will, Michael, et al.
Publicado: (2024)

EdgeMiner: Distributed Process Mining at the Data Sources
por: Andersen, Julia, et al.
Publicado: (2024)

Fast Switching Serial and Parallel Paradigms of SNN Inference on Multi-core Heterogeneous Neuromorphic Platform SpiNNaker2
por: Huang, Jiaxin, et al.
Publicado: (2024)

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

The Entropy of Parallel Systems
por: Adefemi, Temitayo
Publicado: (2025)