Reliability of communication networks with delay constraints: computational complexity and complete topologies
Let G=(V,E) be a graph with a distinguished set of terminal vertices K⫅V. We define the K-diameter of G as the maximum distance between any pair of vertices of K. If the edges fail randomly and independently with known probabilities (vertices are always operational), the diameter-constrained K-termi...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2004-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Online Access: | http://dx.doi.org/10.1155/S016117120430623X |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|