DocumentCode
1704849
Title
Finding the most vital node by node contraction in communication networks
Author
Jun, Wu ; Yue-Jin, Tan
Author_Institution
Dept. of Manage., Nat. Univ. of Defense Technol., Changsha, China
Volume
2
fYear
2005
Lastpage
1286
Abstract
In an undirected graph C=(V,E), let G*vi denote the graph obtained from contracting vi, viz. vi and nodes jointed with vi are replaced by a new node. In this paper, the networks agglomeration is defined firstly. A method of evaluating nodes importance by node contraction in communication networks is proposed based on networks agglomeration. The most vital node is the one whose contraction results in the largest increase of the networks agglomeration. Both degree and position of node are considered with this method. The node contribution is evaluated directly and the result is consistent with our intuitive judgments. Final examples verify its efficiency.
Keywords
graph theory; telecommunication network reliability; telecommunication network routing; telecommunication network topology; communication networks; network agglomeration; network reliability; node contraction; node degree; node importance; node position; undirected graph; vital node; Communication networks; Information management; Intelligent networks; Maintenance; Management information systems; Robustness; Technology management; Telecommunication network reliability; Tree graphs;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, Circuits and Systems, 2005. Proceedings. 2005 International Conference on
Print_ISBN
0-7803-9015-6
Type
conf
DOI
10.1109/ICCCAS.2005.1495340
Filename
1495340
Link To Document