Routing in Recursive Circulant Graphs: Edge Forwarding Index and Hamiltonian Decomposition
暂无分享,去创建一个
[1] Fan Chung Graham,et al. The forwarding index of communication networks , 1987, IEEE Trans. Inf. Theory.
[2] Jiuqiang Liu. Hamiltonian decompositions of Cayley graphs on Abelian groups , 1994, Discret. Math..
[3] André Raspaud,et al. Two Edge-Disjoint Hamiltonian Cycles in the Butterfly Graph , 1994, Inf. Process. Lett..
[4] Kyung-Yong Chwa,et al. Recursive circulant: a new topology for multicomputer networks (extended abstract) , 1994, Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN).
[5] C. Micheneau,et al. Disjoint Hamiltonian Cycles in Recursive Circulant Graphs , 1997, Inf. Process. Lett..
[6] Sajal K. Das,et al. Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992) , 1992, SIGA.
[7] Claude Berge,et al. Graphs and Hypergraphs , 2021, Clustering.
[8] Marie-Claude Heydemann,et al. On forwarding indices of networks , 1989, Discret. Appl. Math..
[9] Jean-Claude Bermond,et al. Hamiltonian decomposition of Cayley graphs of degree 4 , 1989, J. Comb. Theory, Ser. B.
[10] Joseph A. Gallian,et al. Hamiltonian cycles and paths in Cayley graphs and digraphs - A survey , 1996, Discret. Math..