DocumentCode :
2739221
Title :
A note on "reliability polynomials and link importance in networks"
Author :
Chen, Yong ; Hu, Ai-qun ; Yip, Kun-wah ; Hu, Xiao ; Zhong, Zi-guo
Author_Institution :
Dept. of Radio Eng., Southeast Univ., Nanjing, China
Volume :
2
fYear :
2003
fDate :
14-17 Dec. 2003
Firstpage :
1674
Abstract :
In the above reference, L. B. Page examines the use of reliability polynomials to rank the edges in a graph in terms of the overall importance to graph reliability. This letter is a note on the reference by observing the redundancy in the definition for ranking edges based on the number of spanning trees.
Keywords :
polynomials; telecommunication network reliability; trees (mathematics); graph reliability; link importance; ranking edges; reliability polynomials; spanning trees; Combinatorial mathematics; Educational programs; Intelligent networks; Mathematical model; Polynomials; Redundancy; Reliability engineering; Research and development; Topology; Tree graphs;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Neural Networks and Signal Processing, 2003. Proceedings of the 2003 International Conference on
Conference_Location :
Nanjing
Print_ISBN :
0-7803-7702-8
Type :
conf
DOI :
10.1109/ICNNSP.2003.1281205
Filename :
1281205
Link To Document :
بازگشت