Porównaj metody
Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.
| Algorytm Forda-Fulkersona× | Algorytm Push-Relabel× | |
|---|---|---|
| Dziedzina | Badania operacyjne | Badania operacyjne |
| Rodzina | Machine learning | Machine learning |
| Rok powstania≠ | 1956 | 1988 |
| Twórca≠ | Lester R. Ford and Delbert R. Fulkerson | Andrew V. Goldberg and Robert E. Tarjan |
| Typ | algorithm | algorithm |
| Źródło pierwotne≠ | Ford, L. R., & Fulkerson, D. R. (1956). Maximal flow through a network. Canadian Journal of Mathematics, 8(3), 399-404. DOI ↗ | Goldberg, A. V., & Tarjan, R. E. (1988). A new approach to the maximum flow problem. Journal of the ACM, 35(4), 921-940. DOI ↗ |
| Inne nazwy | Ford-Fulkerson method, augmenting path method | preflow-push algorithm, Goldberg-Tarjan algorithm |
| Pokrewne≠ | 4 | 3 |
| Podsumowanie≠ | 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. | The Push-Relabel Algorithm, developed by Andrew V. Goldberg and Robert E. Tarjan in 1988, is a highly efficient method for computing maximum flow in networks. Unlike augmenting path methods, it maintains a preflow and uses local push and global relabeling operations to drive flow toward the sink, achieving superior worst-case complexity. |
| ScholarGateZbiór danych ↗ |
|
|