Algoriti ya Push-Relabel
Algoriti ya Push-Relabel, iliyoandaliwa na Andrew V. Goldberg na Robert E. Tarjan mwaka 1988, ni njia yenye ufanisi mkubwa kwa ajili ya kuhesabu mtiririko wa juu zaidi katika mitandao. Tofauti na mbinu za njia za kuongeza, huhifadhi mtiririko awali (preflow) na hutumia operesheni za ndani za kusukuma (push) na kuweka upya lebo za kimataifa (global relabeling) ili kuelekeza mtiririko kuelekea sinki, na kufikia ugumu bora zaidi wa hali mbaya zaidi.
Soma mbinu kamili
Ingia kwa akaunti ya bure ili kusoma sehemu hii.
Method map
The neighbourhood of related methods — select a node to explore.
Vyanzo
- Goldberg, A. V., & Tarjan, R. E. (1988). A new approach to the maximum flow problem. Journal of the ACM, 35(4), 921-940. DOI: 10.1145/48014.61051 ↗
- Goldberg, A. V. (1998). Recent advances in maximum flow and minimum-cost flow algorithms. In Algorithm Theory (pp. 1-10). Springer, Berlin. link ↗
Jinsi ya kunukuu ukurasa huu
ScholarGate. (2026, June 3). Push-Relabel Algorithm for Maximum Flow. ScholarGate. https://scholargate.app/sw/operations-research/push-relabel-algorithm
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Algorithm ya Bellman-FordUtafiti wa Operesheni↔ compare
- Algoriti ya DijkstraUtafiti wa Operesheni↔ compare
- Algorithmi ya Ford-FulkersonUtafiti wa Operesheni↔ compare
Imerejelewa na
Umeona tatizo kwenye ukurasa huu? Ripoti au pendekeza marekebisho →