Uniformly Optimally Reliable Graphs: A Survey
Resumen:
Which is the most reliable graph with n nodes and m edges? This celebrated problem has several aspects, according to the notion of optimality (in a local or uniform sense), failure type (either nodes or edges), or reliability model (all-terminal connectedness, two-terminal or multiterminal setting). This article presents a chronological survey of the multiple proposals to address the problem, together with recent trends and enigmatic conjectures posed decades ago that promote further research.
| 2021 | |
| Agencia Nacional de Investigación e Innovación | |
|
Uniformly most reliable graph Uniformly least reliable graph All-terminal reliability Two-terminal reliability Failure type Graph theory Ciencias Naturales y Exactas Matemáticas Matemática Aplicada |
|
| Inglés | |
| Agencia Nacional de Investigación e Innovación | |
| REDI | |
| https://hdl.handle.net/20.500.12381/699 | |
| Acceso abierto | |
| Reconocimiento-NoComercial-SinObraDerivada 4.0 Internacional. (CC BY-NC-ND) |
| Sumario: | Which is the most reliable graph with n nodes and m edges? This celebrated problem has several aspects, according to the notion of optimality (in a local or uniform sense), failure type (either nodes or edges), or reliability model (all-terminal connectedness, two-terminal or multiterminal setting). This article presents a chronological survey of the multiple proposals to address the problem, together with recent trends and enigmatic conjectures posed decades ago that promote further research. |
|---|
