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¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Not recorded. Neither this nor any other of the 2 citations of this work carries a recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:1305e64e21bd · see in the full table