STRATEGIES FOR INTERCONNECTION NETWORKS - SOME METHODS FROM GRAPH-THEORY

被引：101

作者：

BERMOND, JC ^{[1
]}

DELORME, C ^{[1
]}

QUISQUATER, JJ ^{[1
]}

机构：

[1] PHILLIPS RES LAB BRUSSELS, B-1170 BRUSSELS, BELGIUM

来源：

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING | 1986年 / 3卷 / 04期

关键词：

D O I：

10.1016/0743-7315(86)90008-0

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：433 / 449

页数：17

共 57 条

[1] ON CONSTRUCTION OF (DK) GRAPHS [J].

AKERS, SB .

IEEE TRANSACTIONS ON ELECTRONIC COMPUTERS, 1965, EC14 (03) :488-&

[2] SOME LARGE GRAPHS WITH GIVEN DEGREE AND DIAMETER [J].

ALEGRE, I ;

FIOL, MA ;

YEBRA, JLA .

JOURNAL OF GRAPH THEORY, 1986, 10 (02) :219-224

[3]

ARDEN BW, 1982, IEEE T COMPUT, V31, P60, DOI 10.1109/TC.1982.1675886

[4]

Berge C., 1973, GRAPHS HYPERGRAPHS, V7

[5] TABLES OF LARGE GRAPHS WITH GIVEN DEGREE AND DIAMETER [J].

BERMOND, JC ;

DELORME, C ;

QUISQUATER, JJ .

INFORMATION PROCESSING LETTERS, 1982, 15 (01) :10-13

[6] LARGE GRAPHS WITH GIVEN DEGREE AND DIAMETER .2. [J].

BERMOND, JC ;

DELORME, C ;

FARHI, G .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 1984, 36 (01) :32-48

[7]

BERMOND JC, 1986, APR P COLL INT PAR A

[8]

BERMOND JC, 1984, GRAPH THEORY COMBINA, P19

[9]

BERMOND JC, 1986, 1ST P JAP C GRAPH TH

[10]

BERMOND JC, 1983, ANN DISCRETE MATH, V17, P65

← 1 2 3 4 5 6 →