A Unified Formula for Analysis of Some Network Reliability Problems
From MaRDI portal
Cited in
(14)- On lattices with Möbius function \(\pm 1,0\)
- Chromatic polynomials and network reliability
- Analysis and synthesis problems for network resilience
- Domination of cyclic monotone \((s,t)\)-graphs
- Network connectivity entropy and its application on network connectivity reliability
- Monomial ideals and the Scarf complex for coherent systems in reliability theory.
- On the characterization of the domination of a diameter-constrained network reliability model
- Equivalent reliability polynomials modeling EAS and their geometries
- A survey of some network reliability analysis and synthesis results
- Efficient computerized Petri net approach for the enumeration of the sets of path identifiers for reliability analysis of broadcasting networks
- On an Invariant of Graphs and the Reliability Polynomial
- Determination of path identifiers for reliability analysis of a broadcasting network using Petri nets
- scientific article; zbMATH DE number 2230203 (Why is no real title available?)
- Note on complexity of computing the domination of binary systems
This page was built for publication: A Unified Formula for Analysis of Some Network Reliability Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3939570)
