The Gross-Saccoman Conjecture is True

Consider a graph with perfect nodes but independent edge failures with identical probability ρ. The reliability is the connectedness probability of the random graph. A graph with n nodes and e edges is uniformly optimally reliable (UOR) if it has the greatest reliability among all graphs with the sa...

Descrición completa

Detalles Bibliográficos

Autor Principal:	Romero, Pablo (author)
Formato:	article
Idioma:	inglés
Publicado:	2020
Subjects:	Graph Theory Uniformly optimally reliable graph Gross-Saccoman conjecture Network Reliability Optimization Multigraphs Ciencias Naturales y Exactas Matemáticas Matemática Aplicada
Acceso en liña:	https://hdl.handle.net/20.500.12381/700
Tags:	Engadir etiqueta Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!