On the characterization of the source-to-all-terminal diameter-constrained reliability domination

Let G = (V;E) be a digraph with a distinguished set of terminal vertices K V and a vertex s 2 K . We de ne the s;K-diameter of G as the maximum distance between s and any of vertices of K. If the arcs fail randomly and independently with known probabilities (vertices are always operational), the D...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Cancela, Héctor, Petingi, Louis
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2003
Materias:
Ciencias Informáticas
Reliability
networks
diameter
domination
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/22636
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata

Ejemplares similares

Ejemplares similares