Graph theoretic characterization and reliability of the generalized Boolean n-cube network-Reference-Cited by-同舟云学术

Graph theoretic characterization and reliability of the generalized Boolean n-cube network

Published:1989-12 Issue:3 Volume:12 Page:375-385
ISSN:0167-8191
Container-title:Parallel Computing
language:en
Short-container-title:Parallel Computing

Author:

Huang Tsung-Chuan,Wang Jhing-Fa,Yang Chu-Sing,Lee Jau-Yien

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Graphics and Computer-Aided Design,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference31 articles.

1. Fault diagnosis in a Boolean n-cube array of microprocessors;Armstrong;IEEE Trans. Comput.,1981

2. Combinatorial optimization problems in the analysis and design of probabilistic networks;Bauer;Networks,1985

3. Generalized hypercube and hyperbus structures for a computer networks;Bhuyan;IEEE Trans. Comput.,1984

4. Algebraic Group Theory;Biggs,1974

5. A computerized algorithm for determining the reliability of redundant configurations;Brown;IEEE Trans. Reliability,1971

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Fault diagnosis for the generalized Boolean n-cube network;Microprocessing and Microprogramming;1992-09

2. Complexity analysis of broadcasting in hypercubes with restricted communication capabilities;Journal of Parallel and Distributed Computing;1992-09

3. A reconfigurable modular fault tolerant generalized Boolean n-cube network;Microprocessing and Microprogramming;1991-08

4. The number of spanning trees of the generalized Boolean n-cube network;Computers & Mathematics with Applications;1988