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

来源：

关键词：

D O I：

10.1016/0743-7315(86)90008-0

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：433 / 449

页数：17

共 57 条

[31]

FINKEL RA, 1981, IEEE T COMPUT, V30, P960, DOI 10.1109/TC.1981.1675735

[32]

Fiol M. A., 1983, 10th Annual International Conference on Computer Architecture Conference Proceedings, P174, DOI 10.1145/800046.801653

[33]

FIOL MA, 1984, IEEE T COMPUT, V33, P400, DOI 10.1109/TC.1984.1676455

[34]

FIOL MA, 1983, STOCHASTICA, V7, P137

[35]

FIOL MA, 1985, ARS COMBIN A, V16, P7

[36]

GOMEZ J, 1985, ARS COMBINATORIA, V20A, P211

[37]

GOMEZ J, 1986, THESIS U POLITECNICA

[38]

GOMEZ J, UNPUB GRAPHS ALPHABE

[39] ON MOORE GRAPHS WITH DIAMETER-2 AND DIAMETER-3 [J].

HOFFMAN, AJ ;

SINGLETON, RR .

[40]

IMASE M, 1983, IEEE T COMPUT, V32, P782, DOI 10.1109/TC.1983.1676323