A FAST PARALLEL ALGORITHM FOR ROUTING IN PERMUTATION NETWORKS

被引：154

作者：

LEV, GF ^{[1
]}

PIPPENGER, N ^{[1
]}

VALIANT, LG ^{[1
]}

机构：

[1] IBM CORP,RES LAB,SAN JOSE,CA 95193

来源：

IEEE TRANSACTIONS ON COMPUTERS | 1981年 / 30卷 / 02期

关键词：

D O I：

10.1109/TC.1981.6312171

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：93 / 100

页数：8

共 22 条

[1] LOOPING ALGORITHM EXTENDED TO BASE 2T REARRANGEABLE SWITCHING NETWORKS [J].

ANDRESEN, S .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1977, 25 (10) :1057-1063

[2] TOWARD A GENERAL CLASS OF TIME-DIVISION-MULTIPLEXED CONNECTING NETWORKS [J].

ANDRESEN, S ;

HARRISON, SR .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1972, CO20 (05) :836-&

[3] FAST PROBABILISTIC ALGORITHMS FOR HAMILTONIAN CIRCUITS AND MATCHINGS [J].

ANGLUIN, D ;

VALIANT, LG .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1979, 18 (02) :155-193

[4]

Benes Vaclav E, 1962, BELL SYST TECH J, V41, P1481

[5] OPTIMAL REARRANGEABLE MULTISTAGE CONNECTING NETWORKS [J].

BENES, VE .

BELL SYSTEM TECHNICAL JOURNAL, 1964, 43 (4P2) :1641-+

[6]

BENES VE, 1965, MATH THEORY CONNECTI

[7] RELATING TIME AND SPACE TO SIZE AND DEPTH [J].

BORODIN, A .

SIAM JOURNAL ON COMPUTING, 1977, 6 (04) :733-744

[8] USING EULER PARTITIONS TO EDGE COLOR BIPARTITE MULTIGRAPHS [J].

GABOW, HN .

INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1976, 5 (04) :345-355

[9]

GABOW HN, UNPUBLISHED

[10] FAST PARALLEL SORTING ALGORITHMS [J].

HIRSCHBERG, DS .

COMMUNICATIONS OF THE ACM, 1978, 21 (08) :657-661

← 1 2 3 →