CAJ | 학술논문

对于一般的有向图,要找到一个有效的算法来计算它的强连通可靠性难度比较大。所以通常只研究可以在多项式时间内计算一些特殊图类的强连通可靠性。J.I.Brown和李晓虎已经得出了完全有向图Kn圮的强连通可靠性。本文研究完全二部有向图Km圮,n的强连通可靠性。
대우일반적유향도,요조도일개유효적산법래계산타적강련통가고성난도비교대。소이통상지연구가이재다항식시간내계산일사특수도류적강련통가고성。J.I.Brown화리효호이경득출료완전유향도Kn비적강련통가고성。본문연구완전이부유향도Km비,n적강련통가고성。
For a general digraph,it is very hard to find an effective algorithm to calculate its strongly connected reliability.This paper pay attention to the strongly connected reliability of some special digraphs which can be calculated in polynomial times.J.I.Brown and Xiaohu Li have given the strongly connected reliability of complete digraphs.In this paper,the strongly connected reliability of the complete bipartite digraphs is studied.