Complete path embeddings in crossed cubes-Reference-Cited by-同舟云学术

Complete path embeddings in crossed cubes

Published:2006-11 Issue:22 Volume:176 Page:3332-3346
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Fan Jianxi,Jia Xiaohua,Lin Xiaola

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference17 articles.

1. Embedding graphs onto the supercube;Auletta;IEEE Trans. Comput.,1995

2. Edge disjoint Hamiltonian cycles in k-ary n-cubes and hypercubes;Bae;IEEE Trans. Comput.,2003

3. Edge congestion and topological properties of crossed cubes;Chang;IEEE Trans. Parallel Distribut. Syst.,2000

4. Topological properties of twisted cubes;Chang;Inform. Sci.,1999

5. Generalized mapping of parallel algorithms onto parallel architectures;Chaudhary;Proc. Int’l Conf. Parallel Process.,1990

Cited by 60 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The edge fault-tolerant spanning laceability of the enhanced hypercube networks;The Journal of Supercomputing;2022-10-31

2. Hamiltonian Properties of the Dragonfly Network;Communications in Computer and Information Science;2022

3. (n − 2)-Fault-Tolerant Edge-Pancyclicity of Crossed Cubes CQn;International Journal of Foundations of Computer Science;2021-01-25

4. Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes;The Journal of Supercomputing;2020-09-16

5. Edge-fault-tolerant pancyclicity of 2-tree-generated networks;International Journal of Computer Mathematics: Computer Systems Theory;2019-10-02