A polynomial time algorithm for the maximal constrained network flow problem based on the bit-arc capacity scaling technique
An efficient polynomial time algorithm for solving maximum flow problems in directed networks has been proposed in this paper. The algorithm is basically based on successive divisions of capacities by multiples of two; it solves the maximum flow problem as a sequence of O(m) shortest path problems o...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
International Academy of Ecology and Environmental Sciences
2023-12-01
|
| Series: | Network Biology |
| Subjects: | |
| Online Access: | http://www.iaees.org/publications/journals/nb/articles/2023-13(4)/maximal-constrained-network-flow-problem.pdf |