A new approach to the maximum-flow problem
Journal of the ACM (JACM)
Very simple methods for all pairs network flow analysis
SIAM Journal on Computing
An efficient algorithm for the minimum capacity cut problem
Mathematical Programming: Series A and B
A faster algorithm for finding the minimum cut in a directed graph
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
Implementing an efficient minimum capacity cut algorithm
Mathematical Programming: Series A and B
Experimental study of minimum cut algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Combinatorial Algorithms
Beyond the flow decomposition barrier
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Experimental Study of Minimum Cut Algorithms
Experimental Study of Minimum Cut Algorithms
EFFICIENT GRAPH ALGORITHMS FOR SEQUENTIAL AND PARALLEL COMPUTERS
EFFICIENT GRAPH ALGORITHMS FOR SEQUENTIAL AND PARALLEL COMPUTERS
Metrics for structural logic synthesis
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Parallel implementations of gusfield's cut tree algorithm
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I
| Hi-index | 0.00 |