Algorithm 97¶
Floyd, R. W. (1962). Algorithm 97: Shortest path. Communications of the ACM, 5(6).
Cited by¶
2 citations across 2 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Dynamic Programming
- The framework encompasses an enormous range of concrete techniques — value iteration and policy iteration for MDPs, the Bellman-Ford and Floyd-Warshall algorithms for shortest paths, the knapsack tabulation, the Viterbi algorithm for hidden Markov model decoding, the Needleman-Wunsch and Smith-Waterman algorithms for biological sequence alignment, the CYK algorithm for context-free-grammar parsing, the matrix-chain-multiplication optimization, and countless others.
This sourceCanonical all-pairs shortest-path DP recurrence (Floyd–Warshall algorithm)
- The framework encompasses an enormous range of concrete techniques — value iteration and policy iteration for MDPs, the Bellman-Ford and Floyd-Warshall algorithms for shortest paths, the knapsack tabulation, the Viterbi algorithm for hidden Markov model decoding, the Needleman-Wunsch and Smith-Waterman algorithms for biological sequence alignment, the CYK algorithm for context-free-grammar parsing, the matrix-chain-multiplication optimization, and countless others.
- Network Flow Models
- Listed in the references but not attached to a specific claim.
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:1305e64e21bd · see in the full table