A Unified Formula for Analysis of Some Network Reliability Problems

DOI10.1109/TR.1982.5221215zbMath0481.90032MaRDI QIDQ3939570

No author found.

Publication date: 1982

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

zbMATH Keywords

reliability measuresnetwork reliabilitycyclic graphsacyclic graphsreliability algorithmtopological formulaexact reliabilityimperfect (unreliable) verticessource-to- terminal problemsource-to-all-vertices problemvertex- to-vertex communication

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (14)

Monomial ideals and the Scarf complex for coherent systems in reliability theory. ⋮ On lattices with Möbius function \(\pm 1,0\) ⋮ Chromatic polynomials and network reliability ⋮ On an Invariant of Graphs and the Reliability Polynomial ⋮ Efficient computerized Petri net approach for the enumeration of the sets of path identifiers for reliability analysis of broadcasting networks ⋮ Network connectivity entropy and its application on network connectivity reliability ⋮ Equivalent reliability polynomials modeling EAS and their geometries ⋮ Determination of path identifiers for reliability analysis of a broadcasting network using Petri nets ⋮ Note on complexity of computing the domination of binary systems ⋮ On the characterization of the domination of a diameter-constrained network reliability model ⋮ A survey of some network reliability analysis and synthesis results ⋮ Unnamed Item ⋮ Domination of cyclic monotone \((s,t)\)-graphs ⋮ Analysis and synthesis problems for network resilience

This page was built for publication: A Unified Formula for Analysis of Some Network Reliability Problems