23 Maximum Flows and Minimum Cuts
نویسندگان
چکیده
In the mid-1950s, Air Force researcher Theodore E. Harris and retired army general Frank S. Ross published a classified report studying the rail network that linked the Soviet Union to its satellite countries in Eastern Europe. The network was modeled as a graph with 44 vertices, representing geographic regions, and 105 edges, representing links between those regions in the rail network. Each edge was given a weight, representing the rate at which material could be shipped from one region to the next. Essentially by trial and error, they determined both the maximum amount of stuff that could be moved from Russia into Europe, as well as the cheapest way to disrupt the network by removing links (or in less abstract terms, blowing up train tracks), which they called ‘the bottleneck’. Their results, including the drawing of the network below, were only declassified in 1999.1
منابع مشابه
Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs
We improve on random sampling techniques for approximately solving problems that involve cuts and flows in graphs. We give a near-linear-time construction that transforms any graph on vertices into an -edge graph on the same vertices whose cuts have approximately the same value as the original graph’s. In this new graph, for example, we can run the -time maximum flow algorithm of Goldberg and...
متن کاملImproved Minimum Cuts and Maximum Flows in Undirected Planar Graphs
In this paper we study minimum cut and maximum flow problems on planar graphs, both in static and in dynamic settings. First, we present an algorithm that given an undirected planar graph computes the minimum cut between any two given vertices in O(n log logn) time. Second, we show how to achieve the same O(n log logn) bound for the problem of computing maximum flows in undirected planar graphs...
متن کاملCuts in Directed Planar Networks by Parallel C Omput at Ions
We reduce the exponent to 3 in the case when the network is embedded in the plane beforehand and to 4 otherwise. The reader is supposed to be familiar with graphs, planar graphs, multigraphs and so on (see [1]). We use the well-known method in a similar way as in [4] which consists in the fact that the problem of finding minimum cuts in a network can be reduced to the shortest path problem in i...
متن کاملMaximum flows and minimum cuts in the plane
A continuous maximum flow problem finds the largest t such that div v = t F (x, y) is possible with a capacity constraint ‖(v1, v2)‖ ≤ c(x, y). The dual problem finds a minimum cut ∂S which is filled to capacity by the flow through it. This model problem has found increasing application in medical imaging, and the theory continues to develop (along with new algorithms). Remaining difficulties i...
متن کاملA Simultaneous Parametric Maximum-Flow Algorithm for Finding the Complete Chain of Solutions
A Simultaneous Parametric Maximum-flow (SPM) algorithm finds the maximum-flow and a min-cut of a bipartite parametric maximum-flow network simultaneously for all values of parameter . λ Instead of working with the original parametric network, a new network is derived from the original and the SPM gives a particular state of the flows in the derived network, from which the nested min-cuts under ...
متن کاملMaximum st-Flow in Directed Planar Graphs via Shortest Paths
Minimum cuts have been closely related to shortest paths in planar graphs via planar duality – so long as the graphs are undirected. Even maximum flows are closely related to shortest paths for the same reason – so long as the source and the sink are on a common face. In this paper, we give a correspondence between maximum flows and shortest paths via duality in directed planar graphs with no c...
متن کامل