Imagen de Portada
Código QR

Negative-Weight Single-Source Shortest Paths in Near-Linear Time.

In this research article, the authors present a simple combinatorial algorithm that reduces running time to near-linear to address the single-source shortest paths problem. The authors present two questions-- including can the algorithm perform without complex machinery-- and five theorems--that dea...

Descripción completa

Publicado en:Communications of the ACM Vol. 68; no. 2; pp. 87 - 95
Autores principales: Bernstein, Aaron, Nanongkai, Danupon, Wulff-Nilsen, Christian
Formato: Artículo
Publicado: Association for Computing Machinery Feb2025
Materias:
Algorithms
Weighted graphs
Directed graphs
Graph algorithms
Graph theory
Decomposition method
Acceso en línea:Ver este registro en EBSCOhost