Domination Invariant of a Diameter Constrained Network Reliability Model
Let G=(V,E) be a digraph with a distinguished set of terminal vertices K in V and a vertex s in K. We define 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...
Tallennettuna:
| Päätekijä: | |
|---|---|
| Muut tekijät: | |
| Aineistotyyppi: | report |
| Julkaistu: |
2004
|
| Aiheet: | |
| Linkit: | http://hdl.handle.net/20.500.12008/3504 |
| Tagit: |
Ei tageja, Lisää ensimmäinen tagi!
|