State space tree method and exact decomposition algorithm for finding network overall reliability
- 19 Downloads
First, 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 smaller computational effort (its computing time complexity isO (en i ), wheree is the number of edges andn i is the number of leaves) and shorter resulting expression. Second, based on it an exact decomposition algorithm for finding communication network overall reliability is presented by applying the hypergraph theory. If we use it to carry out them-time decomposition of a network graph, the communication network scale which can be analyzed by a computer can be extended tom-fold.
Key wordsCommunication network Overall reliability Graph Hypergraph State space tree Exact decomposition algorithm
Unable to display preview. Download preview PDF.