弹性(材料科学)
顶点(图论)
数学
节点(物理)
可靠性(半导体)
系列(地层学)
计算机科学
离散数学
组合数学
理论计算机科学
图形
物理
古生物学
功率(物理)
结构工程
量子力学
生物
工程类
热力学
出处
期刊:SIAM journal on algebraic and discrete methods
[Society for Industrial and Applied Mathematics]
日期:1987-07-01
卷期号:8 (3): 404-409
被引量:61
摘要
The resilience of a network is a measure of its reliability; it is the expected number of node pairs which can communicate. The resilience of an n-vertex series-parallel network can be computed in $O(n^2 )$ time. The algorithm employs the recursive structure of maximal series-parallel networks. In contrast to this, computing the resilience of a planar network is shown to be #P-complete.
科研通智能强力驱动
Strongly Powered by AbleSci AI