摘要
Theweightedreliabilityofnetworkisdefinedasthesumofthemultiplicationoftheprobabilityofeachnetworkstatebyitsnormalizedweightingfactor.Underacertainstate,whenthecapacityformsourcestosinktislargerthanthegivenrequiredcapacityCr,thenthenormalizedweightingfactoris1,otherwise,itistheratioofthecapacitytotherequiredcapacityCr.Thispaperproposesanewalgorithmfortheweightedreliabilityofnet-works,putsforwardtheconceptofsaturatedstateofcapacity,andsuggestsarecursiveformulaforexpandingtheminimalpathstobethesumofqualifyingsubsets.Inthenewalgorithm,theexpansionsoftheminimalpathsdon'tcreatetheirrelevantqualifyingsubsets,thusdecreasingtheunnecessaryexpandingcalculation.Comparedwiththecurrentalgorithms,thisalgorithmhastheadvantageofasmallamountofcomputationsforcomputerimplementa-tion.
出版日期
2000年03月13日（中国期刊网平台首次上网日期，不代表论文的发表时间）
