Embedding of Generalized Fibonacci Cubes in Hypercubes with Faulty Nodes

Authors:
Feng-Shr Jiang;Shi-Jinn Horng;Tzong-Wann Kao
Affiliations:
-;-;-
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1997

Citing 5
Cited 3

Optimum Broadcasting and Personalized Communication in Hypercubes

IEEE Transactions on Computers
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Fibonacci Cubes-A New Interconnection Topology

IEEE Transactions on Parallel and Distributed Systems
Fault-Tolerant Embedding of Complete Binary Trees in Hypercubes

IEEE Transactions on Parallel and Distributed Systems
Distributed Algorithms for Shortest-Path Deadlock-Free Routing and Broadcasting in a Class of Interconnection Topologies

IPPS '92 Proceedings of the 6th International Parallel Processing Symposium

Embedding Fibonacci Cubes into Hypercubes with Omega(2cn) Faulty Nodes

MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
RACE: A Software-Based Fault Tolerance Scheme for Systematically Transforming Ordinary Algorithms to Robust Algorithms

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Fault tolerance analysis of mesh networks with uniform versus nonuniform node failure probability

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

The generalized Fibonacci cubes (abbreviated to GFCs) [4] were recently proposed as a class of interconnection topologies, which cover a spectrum ranging from regular graphs such as the hypercube to semiregular graphs such as the second-order Fibonacci cube in [1]. It has been shown that the kth order GFC of dimension n + k is equivalent to an n-cube for 0 驴n