Uniformly Optimally Reliable Graphs: A Survey

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)....

Full description

Saved in:
Bibliographic Details
Main Author: Romero, Pablo (author)
Format: article
Language:English
Published: 2021
Subjects:
Online Access:https://hdl.handle.net/20.500.12381/699
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1868890222969749504
author Romero, Pablo
author_browse Romero, Pablo
author_facet Romero, Pablo
author_role author
collection REDI
dc.creator.none.fl_str_mv Romero, Pablo
dc.date.none.fl_str_mv 2021-12-06
2022-10-20T23:26:20Z
dc.identifier.none.fl_str_mv https://hdl.handle.net/20.500.12381/699
FCE_1_2019_1_156693
10.1002/net.22085
dc.language.none.fl_str_mv eng
dc.publisher.none.fl_str_mv Wiley
dc.rights.none.fl_str_mv Acceso abierto
info:eu-repo/semantics/openAccess
Reconocimiento-NoComercial-SinObraDerivada 4.0 Internacional. (CC BY-NC-ND)
2022-12-06
dc.source.none.fl_str_mv Networks
reponame:REDI
instname:Agencia Nacional de Investigación e Innovación
instacron:Agencia Nacional de Investigación e Innovación
dc.subject.none.fl_str_mv 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
dc.title.none.fl_str_mv Uniformly Optimally Reliable Graphs: A Survey
dc.type.none.fl_str_mv Artículo
info:eu-repo/semantics/article
Enviado
info:eu-repo/semantics/submittedVersion
description 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.
eu_rights_str_mv openAccess
format article
id anni_ea324a95b9b36194ec7c59e8eec86bec
identifier_str_mv FCE_1_2019_1_156693
10.1002/net.22085
instacron_str Agencia Nacional de Investigación e Innovación
institution Agencia Nacional de Investigación e Innovación
instname_str Agencia Nacional de Investigación e Innovación
language eng
network_acronym_str anni
network_name_str oai-lr-anni
oai_identifier_str oai:redi.anii.org.uy:20.500.12381/699
publishDate 2021
publishDateSort 2021
publisher.none.fl_str_mv Wiley
reponame_str REDI
repository.mail.fl_str_mv
repository.name.fl_str_mv
repository_id_str
rights_invalid_str_mv Acceso abierto
Reconocimiento-NoComercial-SinObraDerivada 4.0 Internacional. (CC BY-NC-ND)
2022-12-06
spelling Uniformly Optimally Reliable Graphs: A SurveyRomero, PabloUniformly most reliable graphUniformly least reliable graphAll-terminal reliabilityTwo-terminal reliabilityFailure typeGraph theoryCiencias Naturales y ExactasMatemáticasMatemática AplicadaWhich 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.Agencia Nacional de Investigación e InnovaciónWiley2022-10-20T23:26:20Z2021-12-06Artículoinfo:eu-repo/semantics/articleEnviadoinfo:eu-repo/semantics/submittedVersionhttps://hdl.handle.net/20.500.12381/699FCE_1_2019_1_15669310.1002/net.22085Networksreponame:REDIinstname:Agencia Nacional de Investigación e Innovacióninstacron:Agencia Nacional de Investigación e InnovaciónengAcceso abiertoinfo:eu-repo/semantics/openAccessReconocimiento-NoComercial-SinObraDerivada 4.0 Internacional. (CC BY-NC-ND)2022-12-06oai:redi.anii.org.uy:20.500.12381/6992026-06-16T05:02:00Z
spellingShingle Uniformly Optimally Reliable Graphs: A Survey
Romero, Pablo
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
status_str submittedVersion
title Uniformly Optimally Reliable Graphs: A Survey
title_full Uniformly Optimally Reliable Graphs: A Survey
title_fullStr Uniformly Optimally Reliable Graphs: A Survey
title_full_unstemmed Uniformly Optimally Reliable Graphs: A Survey
title_short Uniformly Optimally Reliable Graphs: A Survey
title_sort Uniformly Optimally Reliable Graphs: A Survey
topic 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
url https://hdl.handle.net/20.500.12381/699