Diameter constrained reliability: Complexity, distinguished topologies and asymptotic behavior

Let G = ( V , E ) be a simple graph with | V | = n vertices and | E | = m edges, a subset K ⊆ V of terminals, a vector p = ( p 1 , … , p m ) ∈ [ 0 , 1 ] m and a positive integer d , called the diameter. We assume vertices are perfect but edges fail stochastically and independently, with probabilitie...

Ausführliche Beschreibung