Pages that link to "Item:Q5288661"
From MaRDI portal
The following pages link to An O(n*log(n)) algorithm to compute the all-terminal reliability of (K/sub 5/, K/sub 2.2.2/) free networks (Q5288661):
Displaying 7 items.
- An efficient parallel strategy for computing \(K\)-terminal reliability and finding most vital edges in 2-trees and partial 2-trees (Q1268797) (← links)
- Invulnerability of planar two-tree networks (Q1733045) (← links)
- Efficient algorithms for computing the reliability of permutation and interval graphs (Q3211090) (← links)
- Computation of the Reconstruction Probability of Secret Sharing Schemes based on the K-terminal Reliability (Q3438991) (← links)
- Network Reliability and Inner-Four-Cycle-Free Graphs (Q3726169) (← links)
- Resilience of partialk-tree networks with edge and node failures (Q3971579) (← links)
- A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem (Q4268894) (← links)
