A recursive algorithm for finding reliability measures related to the connection of nodes in a graph

DOI10.1002/net.3230100404zbMath0454.68074OpenAlexW2028244023MaRDI QIDQ3902516

John A. Buzacott

Publication date: 1981

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230100404

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15) Reliability and life testing (62N05) Connectivity (05C40)

Related Items (6)

Connectivity of finite anisotropic random graphs and directed graphs ⋮ Lower bounds on two-terminal network reliability ⋮ Counting almost minimum cutsets with reliability applications ⋮ Network reliability: Heading out on the highway ⋮ The Exponential Time Complexity of Computing the Probability That a Graph Is Connected ⋮ Bounds on the Reliability Polynomial for Shellable Independence Systems

This page was built for publication: A recursive algorithm for finding reliability measures related to the connection of nodes in a graph