An Associative Version of the Bellman-Ford Algorithm for Finding the Shortest Paths in Directed Graphs.

A. S. Nepomniaschaya

Published in: PaCT (2001)

Keyphrases

shortest path problem
shortest path
directed graph
dynamic programming
path length
shortest path algorithm
objective function
finding the shortest path
maximum flow
directed acyclic graph
flow graph
minimum cut
undirected graph
weighted graph
binary images
np hard
optimal solution