Optimal capacity expansion arc algorithm on networks

Authors:
Yuhua Liu;Shengsheng Yu;Jingzhong Mao;Peng Yang
Affiliations:
College of Computer Science and Technology, Huazhong, University of Science and Technology, Wuhan, China;College of Computer Science and Technology, Huazhong, University of Science and Technology, Wuhan, China;Department of Mathematics, Central China Normal University, Wuhan, China;Department of Computer Science, Central China Normal University, Wuhan, China
Venue:
CIS'04 Proceedings of the First international conference on Computational and Information Science
Year:
2004

Citing 3
Cited 0

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Flows in Undirected Unit Capacity Networks

SIAM Journal on Discrete Mathematics
A class of bottleneck expansion problems

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of the capacity expansion of a network by means of expanding the capacity of its arcs is elaborated in this paper. By using the theory and algorithm of the maximum flow, the minimum cut-set and the bottleneck of the network can be found, then the expansible arcs are sought according to whether there exists any augmenting path in the minimum cut-set. If the expansible arcs exist,the capacity of the network can be expanded by means of expanding the capacity of those arcs to increase the maximum flow. In order to fulfill the goal, the algorithms of the expansible arc and the optimal expansion arc are presented and the complexity analyses of those algorithms are given as well.