Using the binary representation of arc capacity in a polynomial time algorithm for the constrained maximum flow problem in directed networks
In this paper, the binary representation of arc capacity has been used in developing an efficient polynomial time algorithm for the constrained maximum flow problem in directed networks. The algorithm is basically based on solving the maximum flow problem as a sequence of O(n2) shortest path problem...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
International Academy of Ecology and Environmental Sciences
2022-09-01
|
| Series: | Network Biology |
| Subjects: | |
| Online Access: | http://www.iaees.org/publications/journals/nb/articles/2022-12(3)/constrained-maximum-flow-problem-in-directed-networks.pdf |