%0 Journal Article
%T A New Algorithm for Constructing Disjoint Minimal Path Set of Network<br>构造网络不交化最小路集的一种新算法
%A WU Xiao-yue
%A SHA Ji-chang
%A <br>武小悦
%A 沙基昌
%J 系统工程理论与实践
%D 2000
%I 
%X Constructing disjoint minimal path set is an important approach for reliability analysis of network. In this paper, based on network computation and developed from disjoint algebra and tree constructing algorithm for disjoint minimal path set, is presented a new algorithm for directly constructing disjoint minimal path set. The algorithm is simple and characterized by distributed computing, It provides a new approach for reliability analysis of large scale network system.
%K network
%K reliability
%K algorithm
%K minimal path set<br>网络
%K 可靠性
%K 算法
%K 最小路集
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=01BA20E8BA813E1908F3698710BBFEFEE816345F465FEBA5&cid=962324E222C1AC1D&jid=1D057D9E7CAD6BEE9FA97306E08E48D3&aid=72052384B9AEF305&yid=9806D0D4EAA9BED3&vid=A04140E723CB732E&iid=CA4FD0336C81A37A&sid=95D537AC89B28832&eid=5C3443B19473A746&journal_id=1000-6788&journal_name=系统工程理论与实践&referenced_num=9&reference_num=8