Network transformations and bounding network reliability
From MaRDI portal
Publication:5285474
Recommendations
Cites work
Cited in
(23)- Condensation of a 3-terminal subnetwork into a delta in probabilistic networks
- Chordal 2-connected graphs and spanning trees
- Graph vulnerability parameters, compression, and threshold graphs
- On family of graphs with minimum number of spanning trees
- Graph vulnerability parameters, compression, and quasi-threshold graphs
- On a conjecture of V. Nikiforov
- Chip firing and all-terminal network reliability bounds
- Each (n,m)-graph having the i-th minimal Laplacian coefficient is a threshold graph
- The Wheatstone Bridge Reduction in Network Reliability Computations
- Solution to a conjecture on the maximum skew-spectral radius of odd-cycle graphs
- scientific article; zbMATH DE number 176253 (Why is no real title available?)
- Undirected simple connected graphs with minimum number of spanning trees
- A novel algorithm on network reliability estimation
- Reliability-constrained dimensioning of transmission resources in packet-switched networks
- Extremal graphs for the Tutte polynomial
- Uniformly optimally reliable graphs: A survey
- scientific article; zbMATH DE number 3939394 (Why is no real title available?)
- Network reliability and acyclic orientations
- A reliability-improving graph transformation with applications to network reliability
- Non-Stanley bounds for network reliability
- Reliability covering problems for hypergraphs
- Network reliability: Heading out on the highway
- On a poset of trees
This page was built for publication: Network transformations and bounding network reliability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5285474)