Premium
Optimum requirement spanning trees and reliability of tree networks
Author(s) -
Anazawa Tsutomu,
Kodera Takayuki,
Jimbo Masakazu
Publication year - 1999
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/(sici)1097-0037(199909)34:2<122::aid-net5>3.0.co;2-p
Subject(s) - spanning tree , node (physics) , reliability (semiconductor) , tree (set theory) , minimum spanning tree , degree (music) , computer science , mathematical optimization , mathematics , minimum weight , combinatorics , engineering , power (physics) , physics , structural engineering , quantum mechanics , acoustics
In this paper, an explicit solution of the optimum requirement spanning tree (ORST), studied by Hu, is obtained in the case when a weight is assigned to each node and when maximum‐degree conditions are given. Further, the solution is shown to minimize the probability of communication failure in the situation where one node or line is broken down. © 1999 John Wiley & Sons, Inc. Networks 34: 122–131, 1999