COMBINATORIAL OPTIMIZATION PROBLEMS IN THE ANALYSIS AND DESIGN OF PROBABILISTIC NETWORKS

被引：69
作者：
BAUER, D
BOESCH, F
SUFFEL, C
TINDELL, R
机构：
[1] Stevens Inst of Technology, Hoboken,, NJ, USA, Stevens Inst of Technology, Hoboken, NJ, USA
来源：
NETWORKS | 1985年 / 15卷 / 02期
关键词：
D O I：
10.1002/net.3230150210
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
11
引用
收藏
页码：257 / 271
页数：15
相关论文
共 11 条
[1]   CALCULATING BOUNDS ON REACHABILITY AND CONNECTEDNESS IN STOCHASTIC NETWORKS [J].
BALL, MO ;
PROVAN, JS .
NETWORKS, 1983, 13 (02) :253-278
[2]  
Bauer D., 1981, THEORY APPL GRAPHS, P45
[3]  
BAUER D, UNPUB OPERATIONS RES
[4]   CIRCULANTS AND THEIR CONNECTIVITIES [J].
BOESCH, F ;
TINDELL, R .
JOURNAL OF GRAPH THEORY, 1984, 8 (04) :487-499
[5]  
BOESCH F, UNPUB IEEE T CIRCUIT
[6]  
BOESCH F, UNPUB SIAM J ALG DIS
[7]  
Boesch F.T., 1972, NETWORKS, V2, P261
[8]  
Even S., 1979, GRAPH ALGORITHMS
[9]   MAXIMUM CONNECTIVITY OF A GRAPH [J].
HARARY, F .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 1962, 48 (07) :1142-&
[10]  
Harary F., 1969, GRAPH THEORY, DOI DOI 10.21236/AD0705364
12