An Efficient Parallel Strategy for Computing K-terminal Reliability in Partial 2-trees
碩士 === 國立中央大學 === 資訊及電子工程研究所 === 83 === Analysis of the network reliability is of major importance in computer, communication, power networks, and other networks. The $K$-terminal reliability problem is to compute the probability that the $...
Main Authors: | Hwang You Juish, 黃有志 |
---|---|
Other Authors: | Ho Chin Wen |
Format: | Others |
Language: | en_US |
Published: |
1995
|
Online Access: | http://ndltd.ncl.edu.tw/handle/81192416051232637155 |
Similar Items
-
Efficient computation of the K-terminal reliability of directed acrylic networks.
by: Lee, Chan.
Published: (2012) -
On some problems on k-trees and partial k-trees
by: Skorin-Kapov, Darko
Published: (2010) -
An Improved Approximation of the Partial-Terminal Steiner Tree Problem
by: Wen-Hao Pi, et al.
Published: (2007) -
Completely Independent Spanning Trees in (Partial) k-Trees
by: Matsushita Masayoshi, et al.
Published: (2015-08-01) -
Reliability Analyses on k-out-of-n Systems and K-terminal Networks
by: Jer-Shyan Wu, et al.
Published: (1994)