Shortening the Path to Designing Efficient Graph Algorithms.

This paper introduces a nearly linear-time algorithm for solving the negative weighted shortest-path problem in directed graphs without converting them to undirected counterparts, a departure from traditional approaches. By leveraging advanced graph decomposition techniques, it demonstrates that eff...

Descripción completa

Detalles Bibliográficos

Publicado en:	Communications of the ACM Vol. 68; no. 2; pp. 86 - 87
Autor principal:	Peng, Richard
Formato:	Artículo
Publicado:	Association for Computing Machinery Feb2025
Materias:	Graph algorithms Graph theory Directed graphs Mathematical optimization Undirected graphs
Acceso en línea:	Ver este registro en EBSCOhost