Network transformations and bounding network reliability
From MaRDI portal
Publication:5285474
DOI10.1002/net.3230230103zbMath0780.90046MaRDI QIDQ5285474
John S. Devitt, Charles J. Colbourn, Jason I. Brown
Publication date: 29 June 1993
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230230103
90B18: Communication networks in operations research
90B25: Reliability, availability, maintenance, inspection in operations research
Related Items
Chordal 2‐Connected Graphs and Spanning Trees, On a poset of trees, Undirected simple connected graphs with minimum number of spanning trees, Chip firing and all-terminal network reliability bounds, On a conjecture of V. Nikiforov, Graph vulnerability parameters, compression, and quasi-threshold graphs, Non-Stanley bounds for network reliability, Reliability covering problems for hypergraphs, Graph vulnerability parameters, compression, and threshold graphs, Each \((n,m)\)-graph having the \(i\)-th minimal Laplacian coefficient is a threshold graph, Solution to a conjecture on the maximum skew-spectral radius of odd-cycle graphs, A novel algorithm on network reliability estimation, On family of graphs with minimum number of spanning trees, Extremal graphs for the Tutte polynomial
Cites Work