Fault-tolerant ring embedding in a star graph with both link and node failures
Authors:
- Yu-Chee TsengYTYu-Chee Tseng
- Shu-Hui ChangSCShu-Hui Chang
- Jang-Ping SheuJSJang-Ping Sheu
- 1 January 1997
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 8 (12) , 1185-1195
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- Balanced spanning trees in complete and incomplete star graphsIEEE Transactions on Parallel and Distributed Systems, 1996
- Optimal Communication Algorithms on Star Graphs Using Spanning Tree ConstructionsJournal of Parallel and Distributed Computing, 1995
- Communication aspects of the star graph interconnection networkIEEE Transactions on Parallel and Distributed Systems, 1994
- Fault tolerance of the star graph interconnection networkInformation Processing Letters, 1994
- A comparative study of topological properties of hypercubes and star graphsIEEE Transactions on Parallel and Distributed Systems, 1994
- On the fault-diameter of the star graphInformation Processing Letters, 1993
- Optimal broadcasting on the star graphIEEE Transactions on Parallel and Distributed Systems, 1992
- Distributed fault-tolerant embeddings of rings in hypercubesJournal of Parallel and Distributed Computing, 1991
- Mapping pyramid algorithms into hypercubesJournal of Parallel and Distributed Computing, 1990
- On the Mapping ProblemIEEE Transactions on Computers, 1981