scientific article; zbMATH DE number 4213723

MaRDI QIDQ3360652zbMATH OpenFDO

Authors A. Paszkiewicz

Publication date 1989

zbMATH Keywords

linear graphapproximate probability of the connectivity of a networkunreliable arcsunreliable branches

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Communication networks in operations research (90B18)

Cited in

(12)

• Properties of connectivity components in parallel-sequential connections
• scientific article; zbMATH DE number 4097432 (Why is no real title available?)
• What is the probability of connecting two points?
• scientific article; zbMATH DE number 795107 (Why is no real title available?)
• Application of the majority connectedness carrier for computing the reliability of complex systems
• Distribution series of the probability of existence of simple chains in a two-pole network
• Factorization of network reliability with perfect nodes. II: Connectivity matrix
• scientific article; zbMATH DE number 3994631 (Why is no real title available?)
• Asymptotics for connectivity probability of graph with low reliable arcs
• The Central Limit Theorem and the Law of Large Numbers for Pair-Connectivity in Bernoulli Trees
• scientific article; zbMATH DE number 3965801 (Why is no real title available?)
• scientific article; zbMATH DE number 3968289 (Why is no real title available?)

This page was built for publication:

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