On the characterization of the source-to-all-terminal diameter-constrained reliability domination
Text / resource
Text / resource
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...
Idioma English
El enlace apunta a material asociado, anexos, tablas, datos o página complementaria. No se marca como libro/texto completo.
Material complementario