Improved Time Bounds for the Maximum Flow Problem
From MaRDI portal
Recommendations
Cited in
(57)- Executability of scenarios in Petri nets
- Use of dynamic trees in a network simplex algorithm for the maximum flow problem
- Finding minimum-cost flows by double scaling
- On the computational behavior of a polynomial-time network flow algorithm
- Approximating the permanent of graphs with large factors
- A new fixed point approach for stable networks and stable marriages
- A heuristic for blocking flow algorithms
- Computational investigations of maximum flow algorithms
- On the maximum capacity augmentation algorithm for the maximum flow problem
- A new saling algorithm for the maximum mean cut problem
- Network flow and 2-satisfiability
- On the generalized 2-peripatetic salesman problem
- Computing maximum mean cuts
- Combinatorial optimization in geometry
- Sequential and parallel algorithms for minimum flows.
- Improving time bounds on maximum generalised flow computations by contracting the network
- A generalization of the scaling max-flow algorithm
- On the integral 4-packing of \(T\)-cuts
- Search for all \(d\)-mincuts of a limited-flow network
- A new approach for computing a most positive cut using the minimum flow algorithms
- Maximum network flow with floating point arithmetic.
- Separation, dimension, and facet algorithms for node flow polyhedra
- On solving maximum and quickest interval-valued flows over time
- A Fast and Simple Algorithm for the Maximum Flow Problem
- Stochastic bottleneck transportation problem with flexible supply and demand quantity
- Beyond the flow decomposition barrier
- Faster and more dynamic maximum flow by incremental breadth-first search
- scientific article; zbMATH DE number 4079142 (Why is no real title available?)
- A new approach to the maximum-flow problem
- scientific article; zbMATH DE number 177817 (Why is no real title available?)
- Implementing Goldberg's max-flow-algorithm ? A computational investigation
- NEW MAXIMUM FLOW ALGORITHMS BY MA ORDERMGS AND SCALING
- AO(nm log(U/n)) time maximum flow algorithm
- scientific article; zbMATH DE number 1766747 (Why is no real title available?)
- Transfinite Ford-Fulkerson on a finite network
- Conditional Lower Bounds for All-Pairs Max-Flow
- scientific article; zbMATH DE number 2086656 (Why is no real title available?)
- scientific article; zbMATH DE number 1869742 (Why is no real title available?)
- Chance constrained bottleneck transportation problem with preference of routes
- Recent developments in maximum flow algorithms
- On implementing push-relabel method for the maximum flow problem
- Distance-directed augmenting path algorithms for maximum flow and parametric maximum flow problems
- Simple linear flow decomposition algorithms on trees, circles, and augmented trees
- On strongly polynomial variants of the MBU-simplex algorithm for a maximum flow problem with non-zero lower bounds
- Max flows in O(nm) time, or better
- An o(n^3 )-Time Maximum-Flow Algorithm
- A fast maximum flow algorithm
- Maximum skew-symmetric flows
- A survey on exact algorithms for the maximum flow and minimum‐cost flow problems
- More efficient parallel flow algorithms
- An \(O(mn \log (nU))\) time algorithm to solve the feasibility problem
- Learning-augmented maximum flow
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow
- A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and O(n^ 2m) time
- The maximum flow problem: A max-preflow approach
- Generating pseudo-random permutations and maximum flow algorithms
- A new algorithm for solving the feasibility problem of a network flow
This page was built for publication: Improved Time Bounds for the Maximum Flow Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3830789)
