Fault-tolerant ring embedding in faulty arrangement graphs
暂无分享,去创建一个
[1] Arkady Kanevsky,et al. Embedding rings in recursive networks , 1994, Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing.
[2] Frank Harary,et al. Distance in graphs , 1990 .
[3] Khaled Day,et al. Arrangement Graphs: A Class of Generalized Star Graphs , 1992, Inf. Process. Lett..
[4] Chak-Kuen Wong,et al. Minimum K-hamiltonian graphs , 1984, J. Graph Theory.
[5] Shahram Latifi,et al. Optimal ring embedding in hypercubes with faulty links , 1992, [1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing.
[6] Yu-Chee Tseng,et al. Fault-tolerant ring embedding in star graphs , 1996, Proceedings of International Conference on Parallel Processing.
[7] Bella Bose,et al. Fault-Tolerant Ring Embedding in de Bruijn Networks , 1993, IEEE Trans. Computers.
[8] Chak-Kuen Wong,et al. Minimum k-hamiltonian graphs, II , 1986, J. Graph Theory.
[9] Sheldon B. Akers,et al. The Star Graph: An Attractive Alternative to the n-Cube , 1994, ICPP.
[10] Khaled Day,et al. Embedding of Cycles in Arrangement Graphs , 1993, IEEE Trans. Computers.
[11] Khaled Day,et al. Embedding Grids, Hypercubes, and Trees in Arrangement Graphs , 1993, 1993 International Conference on Parallel Processing - ICPP'93.