Machine learningGraph Algorithms
推送-重贴标签算法
推送-重贴标签算法由Andrew V. Goldberg和Robert E. Tarjan于1988年开发，是一种计算网络最大流的高效方法。与增广路径方法不同，它维护一个预流，并使用局部推送和全局重贴标签操作将流导向汇点，从而实现了卓越的最坏情况复杂度。
阅读完整方法
仅限会员
登录使用免费账户登录即可阅读本节。
Method map
The neighbourhood of related methods — select a node to explore.
来源
- 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 ↗
如何引用本页
ScholarGate. (2026, June 3). Push-Relabel Algorithm for Maximum Flow. ScholarGate. https://scholargate.app/zh/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.
Compare side by side →