Research of Undirected Network Capacity Expansion Based on the Spanning-Tree
This paper gives a mathematical description of the undirected network capacity definitions and theorems of computing capacities towards the network. Prove of the theorem correctness is also given. According to them, the paper proposes an algorithm of computing the undirected network capacities based on spanning tree and even an advanced optimization algorithm. In addition, it discusses network capacity expansion problems with constraints. And then, the optimization algorithm in the scenario of undirected network with limited costs is outlined, whose feasibility and process are illustrated via examples.
KeywordsSpan Tree Network Capacity Capacity Expansion Undirected Network Minimum Capacity
Unable to display preview. Download preview PDF.
- 1.Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall, New York (1993)Google Scholar
- 3.Yang, C., Zhang, J.Z.: A constrained capacity expansion problem on network 70, 19–33 (1998)Google Scholar
- 4.Gondran, Minoux, M., Vajda, M.: Graphs and Algorithms. John Wiley and Sons, New Jersey (1984)Google Scholar
- 6.Wang, H.G., Ma, S.H.: Capacity expansion problem of undirected networks. Journal of Shandong University 28, 418–425 (2001)Google Scholar