Data structures and network algorithms
Data structures and network algorithms
Scaling algorithms for network problems
Journal of Computer and System Sciences
A new approach to the maximum-flow problem
Journal of the ACM (JACM)
A data structure for dynamic trees
Journal of Computer and System Sciences
A fast parametric maximum flow algorithm and applications
SIAM Journal on Computing
Improved time bounds for the maximum flow problem
SIAM Journal on Computing
Very simple methods for all pairs network flow analysis
SIAM Journal on Computing
Finding minimum-cost circulations by successive approximation
Mathematics of Operations Research
Generating pseudo-random permutations and maximum flow algorithms
Information Processing Letters
A faster deterministic maximum flow algorithm
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
A parallel blocking flow algorithm for acyclic networks
Journal of Algorithms
Online load balancing and network flow
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A faster deterministic maximum flow algorithm
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
Approximating s-t minimum cuts in Õ(n2) time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
An o(n^3)-Time Algorithm Maximun-Flow Algorithm
SIAM Journal on Computing
Using random sampling to find maximum flows in uncapacitated undirected graphs
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
Algorithm 360: shortest-path forest with topological ordering [H]
Communications of the ACM
On Implementing Push-Relabel Method for the Maximum Flow Problem
Proceedings of the 4th International IPCO Conference on Integer Programming and Combinatorial Optimization
Flows in undirected unit capacity networks
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
EFFICIENT GRAPH ALGORITHMS FOR SEQUENTIAL AND PARALLEL COMPUTERS
EFFICIENT GRAPH ALGORITHMS FOR SEQUENTIAL AND PARALLEL COMPUTERS
A Maximum-Flow Formulation of the N-Camera Stereo Correspondence Problem
ICCV '98 Proceedings of the Sixth International Conference on Computer Vision
The risk profile problem for stock portfolio optimization (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Exploiting flexibly assignable work to improve load balance
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Comparative analysis of path computation techniques for MPLS traffic engineering
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Towards a new internet architecture
Locating sources to meet flow demands in undirected networks
Journal of Algorithms
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Max- and Min-Neighborhood Monopolies
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Locating Sources to Meet Flow Demands in Undirected Networks
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
From Algorithm to Program to Software Library
Informatics - 10 Years Back. 10 Years Ahead.
The maximum flow problem: a real-time approach
Parallel Computing
Solving Project Scheduling Problems by Minimum Cut Computations
Management Science
Computing Nash equilibria for scheduling on restricted parallel links
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A generalization of the scaling max-flow algorithm
Computers and Operations Research
Chips on wafers, or packing rectangles into grids
Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
Improving Load Balance with Flexibly Assignable Tasks
IEEE Transactions on Parallel and Distributed Systems
Optimal Surface Segmentation in Volumetric Images-A Graph-Theoretic Approach
IEEE Transactions on Pattern Analysis and Machine Intelligence
Graph partitioning using single commodity flows
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
A minimum interference routing algorithm with reduced computational complexity
Computer Networks: The International Journal of Computer and Telecommunications Networking
Implementing approximation algorithms for the single-source unsplittable flow problem
Journal of Experimental Algorithmics (JEA)
A combinatorial, primal-dual approach to semidefinite programs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Balancing applied to maximum network flow problems
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Efficient algorithms for computing all low s-t edge connectivities and related problems
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Faster approximate lossy generalized flow via interior point algorithms
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
On partitioning graphs via single commodity flows
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
On a Special Co-cycle Basis of Graphs
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
The Partial Augment---Relabel Algorithm for the Maximum Flow Problem
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Flow-Based Propagators for the SEQUENCE and Related Global Constraints
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
An Experimental Comparison of Discrete and Continuous Shape Optimization Methods
ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part I
An O(n log n) algorithm for maximum st-flow in a directed planar graph
Journal of the ACM (JACM)
Executability of scenarios in Petri nets
Theoretical Computer Science
Finding sparse cuts locally using evolving sets
Proceedings of the forty-first annual ACM symposium on Theory of computing
Homology flows, cohomology cuts
Proceedings of the forty-first annual ACM symposium on Theory of computing
Graph partitioning using single commodity flows
Journal of the ACM (JACM)
Minimum cuts and shortest homologous cycles
Proceedings of the twenty-fifth annual symposium on Computational geometry
Empirical Evaluation of Graph Partitioning Using Spectral Embeddings and Flow
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Two-Level Push-Relabel Algorithm for the Maximum Flow Problem
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Maximum Bipartite Flow in Networks with Adaptive Channel Width
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Chips on wafers, or packing rectangles into grids
Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Minimum cut bases in undirected networks
Discrete Applied Mathematics
Experimental evaluation of parametric max-flow algorithms
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Panlingual lexical translation via probabilistic inference
Artificial Intelligence
Finding minimum 3-way cuts in hypergraphs
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Proceedings of the forty-second ACM symposium on Theory of computing
Fast algorithms for finding matchings in lopsided bipartite graphs with applications to display ads
Proceedings of the 11th ACM conference on Electronic commerce
Algorithms for multiterminal cuts
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Relating Reputation and Money in Online Markets
ACM Transactions on the Web (TWEB)
A new strategy for the undirected two-commodity maximum flow problem
Computational Optimization and Applications
Multiindex optimal production planning problems
Automation and Remote Control
Fast multi-labelling for stereo matching
ECCV'10 Proceedings of the 11th European conference on computer vision conference on Computer vision: Part III
Approximate string matching with stuck address bits
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Optimization Strategies for the Vulnerability Analysis of the Electric Power Grid
SIAM Journal on Optimization
Maximum bipartite flow in networks with adaptive channel width
Theoretical Computer Science
Approximate string matching with stuck address bits
Theoretical Computer Science
Even faster parameterized cluster deletion and cluster editing
Information Processing Letters
Social content matching in MapReduce
Proceedings of the VLDB Endowment
Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
Proceedings of the forty-third annual ACM symposium on Theory of computing
Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree
Journal of Combinatorial Optimization
Approximating bicolored images from discrete projections
IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
A distributed mincut/maxflow algorithm combining path augmentation and push-relabel
EMMCVPR'11 Proceedings of the 8th international conference on Energy minimization methods in computer vision and pattern recognition
Finding paths with minimum shared edges
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Three-Index linear programs with nested structure
Automation and Remote Control
Maximum flows by incremental breadth-first search
ESA'11 Proceedings of the 19th European conference on Algorithms
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
A distributed preflow-push for the maximum flow problem
IICS'05 Proceedings of the 5th international conference on Innovative Internet Community Systems
Quantum algorithms for matching and network flows
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Properties of Gomory-Hu co-cycle bases
Theoretical Computer Science
Towards synthesis of petri nets from scenarios
ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
Can i execute my scenario in your net? viptool tells you!
ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
Multi-index transport problems with decomposition structure
Automation and Remote Control
Can i execute my scenario in your net?
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Dinitz' algorithm: the original version and even's version
Theoretical Computer Science
Planar open rectangle-of-influence drawings with non-aligned frames
GD'11 Proceedings of the 19th international conference on Graph Drawing
A computational study of the capacity scaling algorithm for the maximum flow problem
Computers and Operations Research
Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem
INFORMS Journal on Computing
Finding a feasible flow in a strongly connected network
Operations Research Letters
On project scheduling with irregular starting time costs
Operations Research Letters
Decomposition of binary images-A survey and comparison
Pattern Recognition
Minimizing a sum of submodular functions
Discrete Applied Mathematics
Contraction network for solving maximum flow problem
Proceedings of the ACM SIGKDD Workshop on Mining Data Semantics
Graph orientations optimizing the number of light or heavy vertices
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Runtime guarantees for regression problems
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Multiindex transportation problems with 2-embedded structure
Automation and Remote Control
An overview of algorithms for network survivability
ISRN Communications and Networking
A new approach to computing maximum flows using electrical flows
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Max flows in O(nm) time, or better
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
On effective TSV repair for 3D-stacked ICs
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
Finding paths with minimum shared edges
Journal of Combinatorial Optimization
| Hi-index | 0.01 |
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our approach leads to an O(min(n2/3, m1/2)m log(n2/m) log U) time bound for a network with n vertices, m arcs, and integral arc capacities in the range [1, …, U]. This is a fundamental improvement over the previous time bounds. We also improve bounds for the Gomory-Hu tree problem, the parametric flow problem, and the approximate s-t cut problem.