## Abstract For __d__ β₯ 1 and __m__ β₯ 1, a graph has property __P__~__d__,__m__~ if there exist at least __m__ vertexβdisjoint paths of length at most __d__ between each pair of vertices. Property __P__~__d__,__m__~, which has a strong connection to wide diameter, is one way of measuring the reliab
On the design of reliable networks
β Scribed by S. L. Hakimi; A. T. Amin
- Publisher
- John Wiley and Sons
- Year
- 1973
- Tongue
- English
- Weight
- 771 KB
- Volume
- 3
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract Optimal toll design from a network reliability point of view is addressed in this paper. Improving network reliability is proposed as a policy objective of road pricing. A reliabilityβbased optimal toll design model, where on the upper level network performance including travel time rel
It was proved that the design problem of the reliable networks for ''small'' edge failure probability is equivalent to finding a max l-min m l graph for given numbers of nodes n and edges e with l Γ [2e/n] by Bauer et al. Furthermore, at least a max l-min m l graph was given for each pair of n and e
## A new concept of reliability of estimation of variables is introduced which relates to the estimability of variables in the presence of sensor failures. Based on this concept, a method for optimal location of sensors in apureflowprocess is developed. A graph-theoretic algorithm, SENNET, develop