Comparar métodos
Revisa los métodos seleccionados uno junto a otro; las filas que difieren aparecen resaltadas.
| Algoritmo de Bellman-Ford× | Algoritmo de Ford-Fulkerson× | |
|---|---|---|
| Campo | Investigación operativa | Investigación operativa |
| Familia | Machine learning | Machine learning |
| Año de origen | 1956 | 1956 |
| Autor original≠ | Richard Bellman and Lester R. Ford | Lester R. Ford and Delbert R. Fulkerson |
| Tipo | algorithm | algorithm |
| Fuente seminal≠ | Bellman, R. (1958). On a routing problem. Quarterly of Applied Mathematics, 16(1), 87-90. DOI ↗ | Ford, L. R., & Fulkerson, D. R. (1956). Maximal flow through a network. Canadian Journal of Mathematics, 8(3), 399-404. DOI ↗ |
| Alias | Bellman-Ford method, Bellman algorithm | Ford-Fulkerson method, augmenting path method |
| Relacionados≠ | 3 | 4 |
| Resumen≠ | The Bellman-Ford Algorithm, developed by Richard Bellman and Lester R. Ford in the 1950s, is a fundamental algorithm for computing shortest paths in weighted graphs that may contain negative edge weights. Unlike Dijkstra's algorithm, it correctly handles negative weights and can detect the presence of negative-weight cycles. | The Ford-Fulkerson Algorithm, developed by Lester R. Ford and Delbert R. Fulkerson in 1956, is a foundational method for computing the maximum flow in a flow network. It finds the maximum amount of flow that can be sent from a source to a sink through a directed graph with capacity constraints on edges. |
| ScholarGateConjunto de datos ↗ |
|
|