Network reliability and acyclic orientations
From MaRDI portal
Recommendations
- Connection reliabilities in stochastic acyclic networks
- Combinatorial aspects of network reliability
- Bounding the Reliability of Networks
- An approach to the assessment of reliability of networks
- Reliability Allocation for Networks and Systems
- On a kind of reliability analysis of networks
- Bounds on the Reliability of Networks
- Network transformations and bounding network reliability
- Optimally reliable networks
Cites work
Cited in
(9)- Efficient enumeration of graph orientations with sources
- scientific article; zbMATH DE number 4002122 (Why is no real title available?)
- An efficient algorithm for computing global reliability of a network
- Triconnected decomposition for computingK-terminal network reliability
- Computing rooted communication reliability in an almost acyclic digraph
- Relative Network Observability and Its Relation With Network Observability
- Network reliability: Heading out on the highway
- Encoding and enumerating acyclic orientations of graphs
- The distribution of the length of the longest path in random acyclic orientations of a complete bipartite graph
This page was built for publication: Network reliability and acyclic orientations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3342378)
