STEINER TREES, PARTIAL 2-TREES, AND MINIMUM IFI NETWORKS

被引：154

作者：

WALD, JA

COLBOURN, CJ

机构：

来源：

关键词：

D O I：

10.1002/net.3230130202

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：159 / 167

页数：9

共 17 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2]

BONDY JA, 1976, GRAPH THEORY APPLICA

[3] NETWORKS IMMUNE TO ISOLATED FAILURES [J].

FARLEY, AM .

[4] COMPUTATION OF THE CENTER AND DIAMETER OF OUTERPLANAR GRAPHS [J].

FARLEY, AM ;

PROSKUROWSKI, A .

[5]

FARLEY AM, 1980, CISTR8021 U OR COMP

[6]

Garey M. R., 1976, Theoretical Computer Science, V1, P237, DOI 10.1016/0304-3975(76)90059-1

[7] RECTILINEAR STEINER TREE PROBLEM IS NP-COMPLETE [J].

GAREY, MR ;

JOHNSON, DS .

[8]

Hakimi S.L., 1973, NETWORKS, V3, P241

[9]

HAKIMI SL, 1972, NETWORKS, V1, P113

[10]

Harary F., 1969, GRAPH THEORY, DOI DOI 10.21236/AD0705364