Recent developments in maximum flow algorithms
From MaRDI portal
Publication:5054836
DOI10.1007/BFb0054350zbMath1502.90182MaRDI QIDQ5054836
Publication date: 9 December 2022
Published in: Algorithm Theory — SWAT'98 (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10)
Related Items (3)
Risk‐averse optimization and resilient network flows ⋮ Algorithms for distributing telecommunication traffic on a multiple-ring SONET-based network. ⋮ Clustering with partial information
Uses Software
Cites Work
- Generating pseudo-random permutations and maximum flow algorithms
- Scaling algorithms for network problems
- An \(O(EV\log^2V)\) algorithm for the maximal flow problem
- A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
- A combinatorial interior point method for network flow problems
- On implementing the push-relabel method for the maximum flow problem
- A data structure for dynamic trees
- Random sampling in cut, flow, and network design problems
- A Fast and Simple Algorithm for the Maximum Flow Problem
- Maximal Flow Through a Network
- Finding Minimum-Cost Circulations by Successive Approximation
- A new approach to the maximum-flow problem
- Improved Time Bounds for the Maximum Flow Problem
- Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Minimum cuts and related problems
- Network Flow and Testing Graph Connectivity
- Implementing Goldberg's max-flow-algorithm ? A computational investigation
- A Faster Deterministic Maximum Flow Algorithm
- A new approach to the minimum cut problem
- A Randomized Maximum-Flow Algorithm
- Online load balancing and network flow
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
- An $o(n^3 )$-Time Maximum-Flow Algorithm
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Recent developments in maximum flow algorithms
