JOURNAL ARTICLE

On the optimality of Bellman–Ford–Moore shortest path algorithm

Stasys JuknaGeorg Schnitger

Year: 2016 Journal:   Theoretical Computer Science Vol: 628 Pages: 101-109   Publisher: Elsevier BV
Keywords:
Semiring Shortest path problem Dynamic programming Path (computing) Mathematics Algorithm Combinatorics Zero (linguistics) K shortest path routing Mathematical optimization Discrete mathematics Computer science

Metrics

14
Cited By
1.19
FWCI (Field Weighted Citation Impact)
22
Refs
0.82
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Interconnection Networks and Systems
Physical Sciences →  Computer Science →  Computer Networks and Communications
Advanced Graph Theory Research
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Limits and Structures in Graph Theory
Physical Sciences →  Mathematics →  Discrete Mathematics and Combinatorics
© 2026 ScienceGate Book Chapters — All rights reserved.