Application of the majority connectedness carrier for computing the reliability of complex systems

DOI10.1134/S0005117907040157MaRDI QIDQ2371633zbMATH OpenFDO

Authors Yanyan Li

Publication date 5 July 2007

Published in Automation and Remote Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Circuits, networks (94C99)

Recommendations

• scientific article; zbMATH DE number 3965801
• scientific article; zbMATH DE number 1218894
• scientific article; zbMATH DE number 3994631
• A method of rapid estimation of the reliability and the coefficient of potential structural invulnerability of links in complex systems
• scientific article; zbMATH DE number 4213723

Cites work

• scientific article; zbMATH DE number 3235858 (Why is no real title available?)
• Application of bipartite graphs to estimate the reliability of complex systems

Cited in

(2)

• scientific article; zbMATH DE number 3869030 (Why is no real title available?)
• scientific article; zbMATH DE number 3994631 (Why is no real title available?)

Describes a project that uses

Uses Software

• Turbo Pascal

This page was built for publication: Application of the majority connectedness carrier for computing the reliability of complex systems

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