|
|
|
| STATE SPACE TREE METHOD AND EXACT DECOMPOSITION ALGORITHM FOR FINDING NETWORK OVERALLRELIABILITY |
| Huang Ruji |
| Beijing University of Science and Technology Beijing |
|
|
|
|
Abstract The state space tree method for finding communication network overall reliability is presented. It directly generates one disjoint tree multilevel polynomial of a network graph. Its advantages are small computational effort and short resulting expression. Based on the state space tree method, an exact decomposition algorithm for finding communication network overall reliability is presented by applying the hypergraph theory. If the m-time decomposition of a network graph is carried out by the algorithm, then the communication network scale which can be analyzed by a computer can be extended to m-fold.
|
|
Received: 01 February 1989
|
|
|
|
|
|
|
1990, Vol. 12 
