An O(n*log(n)) algorithm to compute the all-terminal reliability of (K/sub 5/, K/sub 2.2.2/) free networks

DOI10.1109/24.249577zbMath0771.90047OpenAlexW1995695049MaRDI QIDQ5288661

No author found.

Publication date: 15 August 1993

Published in: IEEE Transactions on Reliability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/24.249577

zbMATH Keywords

all-terminal reliabilityfree graphs

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Queues and service in operations research (90B22)

Related Items (1)

Computation of the Reconstruction Probability of Secret Sharing Schemes based on the K-terminal Reliability

This page was built for publication: An O(n*log(n)) algorithm to compute the all-terminal reliability of (K/sub 5/, K/sub 2.2.2/) free networks