GRAPH THEORETIC CHARACTERIZATION AND RELIABILITY OF THE GENERALIZED BOOLEAN N-CUBE NETWORK

被引：2
|
作者：
HUANG, TC [1 ]
WANG, JF [1 ]
YANG, CS [1 ]
LEE, JY [1 ]
机构：
[1] NATL CHENG KUNG UNIV, DEPT ELECT ENGN, TAINAN, TAIWAN
来源：
PARALLEL COMPUTING | 1989年 / 12卷 / 03期
关键词：
D O I：
10.1016/0167-8191(89)90095-1
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：375 / 385
页数：11
相关论文
共 50 条
  • [1] PARALLEL PERMUTATIONS ON THE GENERALIZED BOOLEAN N-CUBE NETWORK
    WANG, JF
    HUANG, TC
    CA-DSP 89, VOLS 1 AND 2: 1989 INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE AND DIGITAL SIGNAL PROCESSING, 1989, : 415 - 420
  • [2] FAULT-DIAGNOSIS FOR THE GENERALIZED BOOLEAN N-CUBE NETWORK
    HUANG, TC
    YANG, CS
    HUANG, KC
    MICROPROCESSING AND MICROPROGRAMMING, 1992, 35 (1-5): : 661 - 665
  • [3] THE NUMBER OF SPANNING-TREES OF THE GENERALIZED BOOLEAN N-CUBE NETWORK
    HUANG, TC
    WANG, JF
    YANG, CS
    LEE, JY
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1988, 16 (09) : 715 - 725
  • [4] GRAPH THEORETIC RELIABILITY-ANALYSIS FOR THE BOOLEAN N CUBE NETWORKS
    YANG, CS
    WANG, JF
    LEE, JY
    BOESCH, FT
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1988, 35 (09): : 1175 - 1179
  • [5] A RECONFIGURABLE MODULAR FAULT TOLERANT GENERALIZED BOOLEAN N-CUBE NETWORK
    YANG, CS
    WU, SY
    HUANG, KC
    MICROPROCESSING AND MICROPROGRAMMING, 1991, 32 (1-5): : 589 - 592
  • [6] A STRONG FACTORIZATION OF THE GRAPH OF THE N-CUBE
    BIALOSTOCKI, A
    ARS COMBINATORIA, 1986, 22 : 77 - 80
  • [7] ON EDGE NUMBERINGS OF THE N-CUBE GRAPH
    BEZRUKOV, S
    GRUNWALD, N
    WEBER, K
    DISCRETE APPLIED MATHEMATICS, 1993, 46 (02) : 99 - 116
  • [8] ON THE COMPLEXITY OF TESTING A GRAPH FOR N-CUBE
    BHAT, KVS
    INFORMATION PROCESSING LETTERS, 1980, 11 (01) : 16 - 19
  • [9] IMMERSION ALGORITHM OF A RELATED GRAPH IN AN N-CUBE
    SAUCIER, G
    AUTOMATISME, 1971, 16 (01): : 35 - &
  • [10] A RECONFIGURABLE BOOLEAN N-CUBE ARCHITECTURE UNDER FAULTS
    YANG, CS
    WU, SY
    HSIEH, WS
    HUANG, KC
    MICROPROCESSING AND MICROPROGRAMMING, 1992, 35 (1-5): : 673 - 679
12345