Historic Algorithms Help Unlock Shortest-Path Problem Breakthrough: By revisiting key algorithms from computing, a team unlocked hidden efficiency in a long-standing computer science problem.
The article focuses on how revisiting key algorithms from computing history can unlock the hidden efficiency in computer science problems. The author discusses the shortest-path problem that has been long-standing, explores the use of the Bellman-Ford algorithm, and examines the work of Aaron Bernst...
| Publicado en: | Communications of the ACM Vol. 66; no. 9; pp. 10 - 13 |
|---|---|
| Autor principal: | |
| Formato: | Artículo |
| Publicado: |
Association for Computing Machinery
Sep2023
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |