Simple generalized maximum flow algorithms
From MaRDI portal
Recommendations
- A simpler and faster strongly polynomial algorithm for generalized flow maximization
- Faster algorithms for the generalized network flow problem
- A simpler and faster strongly polynomial algorithm for generalized flow maximization
- A generalization of the scaling max-flow algorithm
- New algorithms for generalized network flows
Cited in
(14)- A decomposition algorithm to determine the maximum flow in a generalized network
- Improving time bounds on maximum generalised flow computations by contracting the network
- A generalization of the scaling max-flow algorithm
- A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
- Generalized max flow in series-parallel graphs
- Maximum flow problem in wireless ad hoc networks with directional antennas
- Faster algorithms for the generalized network flow problem
- Greedy approximation algorithms for generalized maximum flow problem towards relation extraction in information networks
- A simpler and faster strongly polynomial algorithm for generalized flow maximization
- Generalized max flows and augmenting paths
- A simpler and faster strongly polynomial algorithm for generalized flow maximization
- A simple GAP-canceling algorithm for the generalized maximum flow problem
- Generalized maximum flow over time with intermediate storage
- Quick max-flow algorithm
This page was built for publication: Simple generalized maximum flow algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3840368)
