释义 |
generalized max-flow min-cut theorem generalized max-flow min-cut theorem[‚jen·rə‚līzd ¦maks‚flō ‚min′kət ‚thir·əm] (mathematics) The theorem that in a generalized s-t network the maximum possible flow value of a generalized feasible flow equals the minimum possible weight of a generalized s-t cut. |