A NEW KARZANOV-TYPE o(n3) MAX-FLOW ALGORITHM
نویسنده
چکیده
A new algorithm is presented for finding maximal and maximum value flows in directed single commodity networks. The algorithm gradually converts a combination of blocking preflows and backflows to a maximal flow in the network. Unlike other maximal flow algorithms, the algorithm treats the network more symmetrically by attempting to increase flow on both the ForwardStep and the BackwardStep. The algorithm belongs to the so called phase algorithms, and is applied to Dinictype layered networks. With an effort of at most 0(n3) for maximum value flow, the algorithm ties with the fastest maximum flow algorithms in dense networks, where m % n*, and can therefore be seen as a significant alternate technique. The algorithm is based on the Karsanov [l] algorithm, and shares features with the algorithm of Tarjan [2], The first version of this algorithm was presented by the author in [3].
منابع مشابه
Flows in Undirected Unit Capacity Networks
We describe an O(min(m,n3/2)m1/2)-time algorithm for finding maximum flows in undirected networks with unit capacities and no parallel edges. This improves upon the previous bound of Karzanov and Even and Tarjan when m = ω(n3/2), and upon a randomized bound of Karger when v = Ω(n7/4/m1/2).
متن کاملAn Improved Algorithm for Packing T-Paths in Inner Eulerian Networks
A digraph G = (V, E) with a distinguished set T ⊆ V of terminals is called inner Eulerian if for each v ∈ V − T the numbers of arcs entering and leaving v are equal. By a T -path we mean a simple directed path connecting distinct terminals with all intermediate nodes in V −T . This paper concerns the problem of finding a maximum T -path packing, i.e. a maximum collection of arc-disjoint T -path...
متن کاملFaster Random Generation of Linear Extensions by Russ Bubley & Martin Dyer
This paper examines the problem of sampling (almost) uniformly from the set of linear extensions of a partial order, a classic problem in the theory of approximate sampling. Previous techniques have relied on deep geometric arguments, or have not worked in full generality. Recently, focus has centred on the Karzanov and Khachiyan Markov chain. In this paper, we define a slightly different Marko...
متن کاملFree multiflows in bidirected and skew-symmetric graphs
A graph (digraph) G = (V,E) with a set T ⊆ V of terminals is called inner Eulerian if each nonterminal node v has even degree (resp. the numbers of edges entering and leaving v are equal). Cherkassky [1] and Lovász [15] showed that the maximum number of pairwise edge-disjoint T -paths in an inner Eulerian graph G is equal to 1 2 ∑ s∈T λ(s), where λ(s) is the minimum number of edges whose remova...
متن کاملOn Integer Multiflow Maximization
Generalizing the two-commodity ow theorem of Rothschild and Whinston and the multiiow theorem of Lovv asz and Cherkasskij, Karzanov and Lomonosov proved a min-max theorem on maximum multiiows in the seventies. Their original proof is quite long and technical and relies on earlier investigations on metrics. The main purpose of the present paper is to provide a relatively simple proof of this the...
متن کامل