The average reliability of a graph
From MaRDI portal
Publication:406318
DOI10.1016/j.dam.2014.05.048zbMath1297.05233OpenAlexW2093687145MaRDI QIDQ406318
Richard Ehrenborg, Jason I. Brown, Danielle Cox
Publication date: 8 September 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.05.048
Related Items
Sixty years of network reliability, Fast reliability ranking of matchstick minimal networks, Network reliability: Heading out on the highway, Network reliability in Hamiltonian graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Chip firing and all-terminal network reliability bounds
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- Uniformly-most reliable networks do not always exist
- A reliability-improving graph transformation with applications to network reliability
- Uniformly optimally reliable graphs
- Taking Limits under the Integral Sign
- On the existence of uniformly optimally reliable networks