Results 1  10
of
1,703,865
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 208 (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
Pushrelabel based algorithms for the maximum transversal problem
, 2013
"... We investigate the pushrelabel algorithm for solving the problem of finding a maximum cardinality matching in a bipartite graph in the context of the maximum transversal problem. We describe in detail an optimized yet easytoimplement version of the algorithm and finetune its parameters. We also ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
We investigate the pushrelabel algorithm for solving the problem of finding a maximum cardinality matching in a bipartite graph in the context of the maximum transversal problem. We describe in detail an optimized yet easytoimplement version of the algorithm and finetune its parameters. We also
TwoLevel PushRelabel Algorithm for the Maximum Flow Problem
"... We describe a twolevel pushrelabel algorithm for the maximum flow problem and compare it to the competing codes. The algorithm generalizes a practical algorithm for bipartite flows. Experiments show that the algorithm performs well on several problem families. ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
We describe a twolevel pushrelabel algorithm for the maximum flow problem and compare it to the competing codes. The algorithm generalizes a practical algorithm for bipartite flows. Experiments show that the algorithm performs well on several problem families.
Investigations on pushrelabel based algorithms for the maximum transversal problem
, 2012
"... ..."
loo Experimental Evaluation of the PushRelabel Method for the MinimumCost Flow Problem
, 1991
"... Sap*©*« * to m ^ »«f^ ..."
A CacheAware Parallel Implementation of the PushRelabel Network Flow Algorithm and Experimental Evaluation of the Gap Relabeling Heuristic
"... The maximum flow problem is a combinatorial problem of significant importance in a wide variety of research and commercial applications. It has been extensively studied and implemented over the past 40 years. The pushrelabel method has been shown to be superior to other methods, both in theoretical ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
bounds and in experimental implementations. Our study discusses the implementation of the pushrelabel network flow algorithm on presentday symmetric multiprocessors (SMP’s) with large shared memories. The maximum flow problem is an irregular graph problem and requires frequent finegrained locking
A Computational Study of the Pseudoflow and Pushrelabel Algorithms for the Maximum Flow Problem
"... We present the results of a computational investigation of the pseudoflow and pushrelabel algorithms for the maximum flow and minimum st cut problems. The two algorithms were tested on several problem instances from the literature. Our results show that our implementation of the pseudoflow algorit ..."
Abstract

Cited by 19 (6 self)
 Add to MetaCart
We present the results of a computational investigation of the pseudoflow and pushrelabel algorithms for the maximum flow and minimum st cut problems. The two algorithms were tested on several problem instances from the literature. Our results show that our implementation of the pseudoflow
A new approach to the maximum flow problem
 JOURNAL OF THE ACM
, 1988
"... All previously known efficient maximumflow algorithms work by finding augmenting paths, either one path at a time (as in the original Ford and Fulkerson algorithm) or all shortestlength augmenting paths at once (using the layered network approach of Dinic). An alternative method based on the pre ..."
Abstract

Cited by 672 (34 self)
 Add to MetaCart
All previously known efficient maximumflow algorithms work by finding augmenting paths, either one path at a time (as in the original Ford and Fulkerson algorithm) or all shortestlength augmenting paths at once (using the layered network approach of Dinic). An alternative method based
A PushRelabel Framework for Submodular Function Minimization and Applications to Parametric Optimization
 Discrete Applied Mathematics
, 2001
"... Recently, the first combinatorial strongly polynomial algorithms for submodular function minimization have been devised independently by Iwata, Fleischer, and Fujishige and by Schrijver. In this paper, we improve the running time of Schrijver's algorithm by designing a pushrelabel framework ..."
Abstract

Cited by 29 (5 self)
 Add to MetaCart
Recently, the first combinatorial strongly polynomial algorithms for submodular function minimization have been devised independently by Iwata, Fleischer, and Fujishige and by Schrijver. In this paper, we improve the running time of Schrijver's algorithm by designing a pushrelabel
Dynamically tuned pushrelabel algorithm for the maximum flow problem on cpugpuhybrid platforms
 In The 24th IEEE International Parallel and Distributed Processing Symposium
, 2010
"... Abstract—The maximum flow problem is a fundamental graph theory problem with many important applications. Maxflow algorithms based on the pushrelabel method are known to have better complexity bound and faster practical execution speed than others. However, existing pushrelabel algorithms are des ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Abstract—The maximum flow problem is a fundamental graph theory problem with many important applications. Maxflow algorithms based on the pushrelabel method are known to have better complexity bound and faster practical execution speed than others. However, existing pushrelabel algorithms
Results 1  10
of
1,703,865