THE MULTI-TREE APPROACH TO RELIABILITY IN DISTRIBUTED NETWORKS

被引：189

作者：

ITAI, A ^{[1
]}

RODEH, M ^{[1
]}

机构：

[1] IBM ISRAEL SCI CTR,HAIFA,ISRAEL

来源：

关键词：

D O I：

10.1016/0890-5401(88)90016-8

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：43 / 59

页数：17

共 15 条

[1]

Edmonds J., 1972, COMBINATORIAL ALGORI, P91

[2]

Even S., 1976, Theoretical Computer Science, V2, P339, DOI 10.1016/0304-3975(76)90086-4

[3]

Even S., 1979, GRAPH ALGORITHMS

[4]

FISCHER MJ, 1983, 1983 P ACM S PRINC D, P1

[5] COVERING GRAPHS BY SIMPLE CIRCUITS [J].

ITAI, A ;

LIPTON, RJ ;

PAPADIMITRIOU, CH ;

RODEH, M .

[6]

ITAI A, 1978, 5TH P C AUT LANG PRO, P289

[7]

Lempel A., 1967, Theory of graphs-international symposium, P215

[8]

LEMPEL A, 1984, COMMUNICATION

[9]

REIF J, 1983, DEPTH 1ST SEARCH IS

[10] EDGE-DISJOINT BRANCHING IN DIRECTED MULTIGRAPHS [J].

SHILOACH, Y .