IEEE Trans. Reliab.,

DOI10.1080/15326349208807226MaRDI QIDQ4012377zbMATH OpenOpenAlexFDO

Authors Frank Beichelt, Peter Tittmann

Publication date 27 September 1992

Published in Communications in Statistics. Stochastic Models (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/15326349208807226

zbMATH Keywords

decomposition of networksnumerical examplesrandom graphreliabilitystochastic network

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Applications of renewal theory (reliability, demand theory, etc.) (60K10)

Recommendations

• scientific article; zbMATH DE number 21369
• Reliability-Equivalent-Separation of a Node
• A combined decomposition-reduction approach to the K-terminal reliability of. stochastic networks
• Partitions and network reliability
• Triconnected decomposition for computingK-terminal network reliability

Cited in

(3)

• A combined decomposition-reduction approach to the K-terminal reliability of. stochastic networks
• Splitting formulas for computing connectedness probability of undirected graphs
• scientific article; zbMATH DE number 21369 (Why is no real title available?)

This page was built for publication: IEEE Trans. Reliab.,

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4012377)