首页> 美国政府科技报告 >A Theorem Concerning Cyclic Directed Graphs with Applications to Network Reliability.
【24h】

A Theorem Concerning Cyclic Directed Graphs with Applications to Network Reliability.

机译:关于循环有向图的一个定理及其在网络可靠性中的应用。

获取原文

摘要

In a recent paper, Satyanarayana and Prabhaker have presented a new topological formula for evaluating exact reliability of terminal-pair directed networks. Terms in the formula are associated in a one-to-one fashion with certain acyclic subgraphs of the network, cyclic subgraphs being of no importance. In their paper, however, the proof that cyclic subgraphs may be ignored seems to be incomplete. We consider an alternate proof of this fact. (Author)

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号