SOME GRAPH-COLORING THEOREMS WITH APPLICATIONS TO GENERALIZED CONNECTION NETWORKS

被引：13

作者：

KIRKPATRICK, DG ^{[1
]}

KLAWE, M ^{[1
]}

PIPPENGER, N ^{[1
]}

机构：

[1] UNIV BRITISH COLUMBIA,VANCOUVER V6T 1W5,BC,CANADA

来源：

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS | 1985年 / 6卷 / 04期

关键词：

D O I：

10.1137/0606057

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：576 / 582

页数：7

共 14 条

[1]

Bassalygo L. A., 1981, Problems of Information Transmission, V17, P206

[2]

BENES VE, 1965, MATH THEORY CONNECTI

[3]

Berge C., 1973, GRAPHS HYPERGRAPHS, V7

[4]

DOLEV D, 1983, 15TH P ANN ACM S THE, P42

[5] EXPLICIT CONSTRUCTIONS OF LINEAR-SIZED SUPERCONCENTRATORS [J].

GABBER, O ;

GALIL, Z .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1981, 22 (03) :407-420

[6] CONTROL ALGORITHMS FOR REARRANGEABLE CLOS NETWORKS [J].

HWANG, FK .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1983, 31 (08) :952-954

[7] A FAST PARALLEL ALGORITHM FOR ROUTING IN PERMUTATION NETWORKS [J].

LEV, GF ;

PIPPENGER, N ;

VALIANT, LG .

IEEE TRANSACTIONS ON COMPUTERS, 1981, 30 (02) :93-100

[8]

Masson G. M., 1972, NETWORKS, V2, P191

[9] PARALLEL PERMUTATION AND SORTING ALGORITHMS AND A NEW GENERALIZED CONNECTION NETWORK [J].

NASSIMI, D ;

SAHNI, S .

JOURNAL OF THE ACM, 1982, 29 (03) :642-667

[10]

OFMAN YP, 1965, T MOSCOW MATH SOC, V14, P200

← 1 2 →