max-flow min-cut theorem

(redirected from Minimal cut)

max-flow min-cut theorem

[‚maks¦flō ‚min′kət ‚thir·əm]
(industrial engineering)
In the analysis of networks, the concept that for any network with a single source and sink, the maximum feasible flow from source to sink is equal to the minimum cut value for any of the cuts of the network.
(mathematics)
References in periodicals archive ?
Were also going to get our ecologist to develop a long-term planting strategy for these minimal cut zones so they have a mixture of low-stature native grasses and shrubs that provide shade for fish and improved habitat for inanga spawning, but also give the public access to the waterways, Mr Davison says.
When I was working in New York, I experienced living in the so-called brownstone apartments, or micro studios, which have minimal cut of 11 square meters [sq m],' Yujuico recalled.
By applying state space reduction and heuristic search, a much smaller reachable space needs to be explored and thus the efficiency of proposed minimal cut sets algorithm has been improved.
According to maximal flow and minimal cut of network information flow, the maximal value W of flow that from source S to information sink T equals to the capacity of its minimal cut.
My impeccably placed spies revealed how the frizzy haired star settled into the chair and gave his usual straight-talking instructions - namely a minimal cut to keep his famed nutty professor look.
On a green strip cunningly given a minimal cut by the canny Thomas to allow bowlers a break on the normally batter-friendly square, seamers Stuart Wood (3-2) and Sam Beighton (3-9) destroyed the normally high-scoring PwC top order with some impressive inswing bowling.
With a minimal cut in funds and employees and a new trust fund to help pay for continuing operations, Florida court officials and Bar leaders are calling last month's special legislative session at least a good first step.
If b were a cut node in D, then there would be a minimal cut in D containing exactly a proper subset of the arcs incident to b (consider the set of arcs going from b to one of the components of D after the removal of b).
A minimal cut can be computed in polynomial time via algorithms based on network flow such as the one proposed by Ford and Fulkerson (1955) or more recently by Boykov and Kolmogorov (2004).
The ecological impact on the site was also a significant consideration, with minimal cut and fill, the provision of carefully integrated storm water retention areas, and the replanting of all disrupted areas with native species.
It is therefore necessary, before any quantitative analysis is carried out, to reduce the tree into its minimal form and thus determine the minimal cut sets.
Trendy, minimal cuts and light hues such as powder blue, baby pink, lilac and cream completed the showcase.

Full browser ?