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

Stasys Jukna; Georg Schnitger

doi:10.1016/j.tcs.2016.03.014

ScienceGate Book Chapters

JOURNAL ARTICLE

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

Stasys Jukna Georg Schnitger

Year: 2016 Journal: Theoretical Computer Science Vol: 628 Pages: 101-109 Publisher: Elsevier BV

DOI: 10.1016/j.tcs.2016.03.014

Get Full-Text PDF Get Analytical Report

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

Cited By

1.19

FWCI (Field Weighted Citation Impact)

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

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

Metrics

Citation History

Topics

Related Documents

Bellman-Ford Algorithm for Shortest Path Selection

Extended Shortest Path Problem - Generalized Dijkstra-Moore and Bellman-Ford Algorithms

Shortest Path Identification in Reconfigurable Microgrid Using Hybrid Bellman Ford-Dijkstra’s Algorithm

Dijkstra’s Algorithm with Bellman-Ford for Shortest Path Discovery in Big Data

Single source shortest path algorithm Dijkstra and Bellman-Ford Algorithms: A Comparative study