Nonexistence of uniformly most reliable two-terminal graphs
From MaRDI portal
Publication:2235777
DOI10.1016/j.tcs.2021.09.025OpenAlexW3203057846MaRDI QIDQ2235777
Publication date: 21 October 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.09.025
reliability polynomialtwo-terminal reliabilitylocally most reliabletarget verticestwo-terminal graphuniformly most reliable
Related Items (1)
Cites Work
- Unnamed Item
- A linear time algorithm for computing the most reliable source on a series--parallel graph with unreliable edges
- Two path extremal graphs and an application to a Ramsey-type problem
- Invulnerability of planar two-tree networks
- Classes of uniformly most reliable graphs for all-terminal reliability
- Uniformly-most reliable networks do not always exist
- On unreliability polynomials and graph connectivity in reliable network synthesis
- Combinatorial optimization problems in the analysis and design of probabilistic networks
- Complexity of network reliability computations
- On graphs with randomly deleted edges
- Uniformly optimally reliable graphs
- Nonexistence of optimal graphs for all terminal reliability
- On uniformly most reliable two‐terminal graphs
- On the existence of uniformly optimally reliable networks
This page was built for publication: Nonexistence of uniformly most reliable two-terminal graphs
