Results 1  10
of
10
On implementing the pushrelabel method for the maximum flow problem
, 1994
"... We study efficient implementations of the pushrelabel method for the maximum flow problem. The resulting codes are faster than the previous codes, and much faster on some problem families. The speedup is due to the combination of heuristics used in our implementation. We also exhibit a family of p ..."
Abstract

Cited by 151 (10 self)
 Add to MetaCart
We study efficient implementations of the pushrelabel method for the maximum flow problem. The resulting codes are faster than the previous codes, and much faster on some problem families. The speedup is due to the combination of heuristics used in our implementation. We also exhibit a family of problems for which all known methods seem to have almost quadratic time growth rate.
Improved Algorithms For Bipartite Network Flow
, 1994
"... In this paper, we study network flow algorithms for bipartite networks. A network G = (V; E) is called bipartite if its vertex set V can be partitioned into two subsets V 1 and V 2 such that all edges have one endpoint in V 1 and the other in V 2 . Let n = jV j, n 1 = jV 1 j, n 2 = jV 2 j, m = jE ..."
Abstract

Cited by 41 (5 self)
 Add to MetaCart
In this paper, we study network flow algorithms for bipartite networks. A network G = (V; E) is called bipartite if its vertex set V can be partitioned into two subsets V 1 and V 2 such that all edges have one endpoint in V 1 and the other in V 2 . Let n = jV j, n 1 = jV 1 j, n 2 = jV 2 j, m = jEj and assume without loss of generality that n 1 n 2 . We call a bipartite network unbalanced if n 1 ø n 2 and balanced otherwise. (This notion is necessarily imprecise.) We show that several maximum flow algorithms can be substantially sped up when applied to unbalanced networks. The basic idea in these improvements is a twoedge push rule that allows us to "charge" most computation to vertices in V 1 , and hence develop algorithms whose running times depend on n 1 rather than n. For example, we show that the twoedge push version of Goldberg and Tarjan's FIFO preflow push algorithm runs in O(n 1 m + n 3 1 ) time and that the analogous version of Ahuja and Orlin's excess scaling algori...
An Implementation of the Binary Blocking Flow Algorithm
, 1998
"... Goldberg and Rao recently devised a new binary blocking flow algorithm for computing maximum flows in networks with integer capacities. We describe an implementation of variants of the binary blocking flow algorithm geared towards practical efficiency and report on preliminary experimental result ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Goldberg and Rao recently devised a new binary blocking flow algorithm for computing maximum flows in networks with integer capacities. We describe an implementation of variants of the binary blocking flow algorithm geared towards practical efficiency and report on preliminary experimental results obtained with our implementation. 1. Introduction Despite intensive research for more than three decades, problems related to flows in networks still motivate cuttingedge algorithmic research. In a recent development, Goldberg and Rao [4] combined elements of the algorithms of Dinitz [2] and Even and Tarjan [3] with new arguments to obtain a simple algorithm, the binary blocking flow (BBF) algorithm, for computing maximum flows in networks with integer capacities. On networks with n vertices, m edges, and integer capacities bounded by U , the algorithm runs in O(m log(n 2 =m) log U) time, where, here and in the following, = minfm 1=2 ; n 2=3 g. The running time mentioned above p...
2.3 Single Path Labeling Methods Beginning With A FeasibleFlowVector......................
"... ..."
Computer Science Journal of Moldova, vol.9, no.3(27), 2001 Algorithms for minimum flows ∗
"... We present a generic preflow algorithm and several implementations of it, that solve the minimum flow problem in O(n 2 m) time. ..."
Abstract
 Add to MetaCart
We present a generic preflow algorithm and several implementations of it, that solve the minimum flow problem in O(n 2 m) time.