Research of undirected network capacity expansion based on the spanning-tree

Authors:
Yuhua Liu;Kaihua Xu;Hao Huang;Wei Teng
Affiliations:
Department of Computer Science, Central China, Normal University, Wuhan, China;Research Center of the Digital Space Technology, Central China, Normal University, Wuhan, China;Department of Computer Science, Central China, Normal University, Wuhan, China;Department of Computer Science, Central China, Normal University, Wuhan, China
Venue:
SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
Year:
2006

Citing 4
Cited 0

Graphs and algorithms

Graphs and algorithms
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
A class of bottleneck expansion problems

Computers and Operations Research
Recent Developments in Maximum Flow Algorithms (Invited Lecture)

SWAT '98 Proceedings of the 6th Scandinavian Workshop on Algorithm Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.