A Min Flow Max Cut Theorem
نویسنده
چکیده
Consider a network of pipes joining a set of intakes (the source) to a separate set of outlets (the e n sink), so that liquid flows from the intakes, through the network, to the outlets. A cross-section of th etwork, separating the intakes on one side from the outlets on the other, is called a cut. A minimal t c cut is one that, roughly speaking, slices through a set of pipes whose combined capacity is minimal. I an be shown that if we attempt to force as much liquid as possible through the system, the maximal , a flow possible is equal to the capacity of a minimal cut. An abstraction and generalization of this result pplied to a network of nodes joined by directed arcs, is known as the Max Flow Min Cut Theorem for
منابع مشابه
A Max-Flow Min-Cut Theorem with Applications in Small Worlds and Dual Radio Networks
Intrigued by the capacity of random networks, we start by proving a max-flow min-cut theorem that is applicable to any random graph obeying a suitably defined independence-in-cut property. We then show that this property is satisfied by relevant classes, including small world topologies, which are pervasive in both man-made and natural networks, and wireless networks of dual devices, which expl...
متن کاملAn Approximate Max-Flow Min-Cut Relation for Unidirected Multicommodity Flow, with Applications
In this paper , we prove the first approximate max-flow min-cut theorem for undirected mul t i commodi ty flow. We show tha t for a feasible flow to exist in a mul t icommodi ty problem, it is sufficient t ha t every cut ' s capacity exceeds its demand by a factor of O(logClogD), where C is the sum of all finite capacities and D is the sum of demands . Moreover, our theorem yields an a lgor i t...
متن کاملLogical s-t Min-Cut Problem: An Extension to the Classic s-t Min-Cut Problem
Let $G$ be a weighted digraph, $s$ and $t$ be two vertices of $G$, and $t$ is reachable from $s$. The logical $s$-$t$ min-cut (LSTMC) problem states how $t$ can be made unreachable from $s$ by removal of some edges of $G$ where (a) the sum of weights of the removed edges is minimum and (b) all outgoing edges of any vertex of $G$ cannot be removed together. If we ignore the second constraint, ca...
متن کاملFlow Networks and the Min-Cut-Max-Flow Theorem
We present a formalization of flow networks and the Min-Cut-MaxFlow theorem. Our formal proof closely follows a standard textbook proof, and is accessible even without being an expert in Isabelle/HOL— the interactive theorem prover used for the formalization.
متن کاملOn Packing T-Cuts
A short proof of a difficult theorem of P.D. Seymour on grafts with the max-flow min-cut property is given.
متن کاملMax-flow min-cut theorem for Rényi entropy in communication networks
A symbolic approach to communication networks, where the topology of the underlying network is contained in a set of formal terms, was recently introduced. Many communication problems can be recast as dispersion problems in this setup. The so-called min-cut of a term set represents its number of degrees of freedom. For any assignment of function symbols, its dispersion measures the amount of in...
متن کامل