%0 Journal Article
%T A Polynomial Time Algorithm for Computing Reliability of Two Classes of Networks<br>计算两类网络的可靠性的多项式时间算法
%A KONG Fan-ji
%A WANG Guang-xing
%A ZHANG Xiang-de
%A <br>孔繁甲
%A 王光兴
%A 张祥德
%J 软件学报
%D 1999
%I 
%X In this paper, two classes of directed networksORCnetworks and IRCnetworks are defined, and a polynomial time algorithm is presented for computing their rooted communication reliability, i.e. the probability that a specified vertex, root vertex, can communicate with all other vertices. The complexity of the algorithm for ORCnetworks and IRCnetworks is O(|E|) and O(|V||E|) respectively, where |V| and |E| are the number of vertices and of edges of networks respectively.
%K Network
%K reliability
%K algorithm
%K algorithm complexity<br>网络
%K 可靠性
%K 算法
%K 算法复杂性.
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=251E67D8B757FA9E&yid=B914830F5B1D1078&vid=F3090AE9B60B7ED1&iid=38B194292C032A66&sid=90612DF06FCE4D55&eid=377D325742940769&journal_id=1000-9825&journal_name=软件学报&referenced_num=0&reference_num=5