Maximal intervals of decrease and inflection points for node reliability
From MaRDI portal
Publication:832992
DOI10.1016/j.dam.2022.02.002zbMath1485.90028OpenAlexW3138117670MaRDI QIDQ832992
Publication date: 28 March 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2022.02.002
Graph polynomials (05C31) Graph theory (including graph drawing) in computer science (68R10) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Computing residual connectedness reliability for restricted networks
- Uniformly optimal graphs in some classes of graphs with node failures
- The shape of node reliability
- The Complexity of the Residual Node Connectedness Reliability Problem
- On reliability of graphs with node failures
- Reliability polynomials having arbitrarily many inflection points
- Unnamed Item
This page was built for publication: Maximal intervals of decrease and inflection points for node reliability