Balanced Spanning Trees in Complete and Incomplete Star Graphs
暂无分享,去创建一个
[1] Sartaj Sahni,et al. Embedding Hamiltonians and Hypercubes in Star Interconnection Graphs , 1990, ICPP.
[2] S. Lakshmivarahan,et al. Embedding of cycles and grids in star graphs , 1990, Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990.
[3] Jelena V. Misic,et al. Communication Aspects of the Star Graph Interconnection Network , 1994, IEEE Trans. Parallel Distributed Syst..
[4] Sheldon B. Akers,et al. The Star Graph: An Attractive Alternative to the n-Cube , 1994, ICPP.
[5] Jang-Ping Sheu,et al. A Broadcasting Algorithm in Star Graph Interconnection Networks , 1993, Inf. Process. Lett..
[6] S. Lennart Johnsson,et al. Optimum Broadcasting and Personalized Communication in Hypercubes , 1989, IEEE Trans. Computers.
[7] Shahram Latifi,et al. Incomplete Star: An Incrementally Scalable Network Based on the Star Graph , 1994, IEEE Trans. Parallel Distributed Syst..
[8] Ivan Stojmenovic,et al. Data communication and computational geometry on the star and pancake interconnection networks , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.
[9] Qing Hu,et al. The 4-Star Graph is not a Subgraph of Any Hypercube , 1993, Inf. Process. Lett..
[10] Dilip Sarkar,et al. Optimal Broadcasting on the Star Graph , 1992, IEEE Trans. Parallel Distributed Syst..
[11] Khaled Day,et al. A Comparative Study of Topological Properties of Hypercubes and Star Graphs , 1994, IEEE Trans. Parallel Distributed Syst..
[12] Jang-Ping Sheu,et al. An Optimal Broadcasting Algorithm without Message Redundancy in Star Graphs , 1995, IEEE Trans. Parallel Distributed Syst..
[13] S. Lakshmivarahan,et al. Embedding of cycles and Grids in Star Graphs , 1991, J. Circuits Syst. Comput..