Fault-tolerant Hamiltonian laceability of balanced hypercubes-Reference-Cited by-同舟云学术

Fault-tolerant Hamiltonian laceability of balanced hypercubes

Published:2015-04 Issue: Volume:300 Page:20-27
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Zhou Qingguo,Chen Dan,Lü Huazhong

Funder

National Natural Science Foundation of China

Publisher

Elsevier BV

Subject

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

Reference27 articles.

1. Hamiltonian laceability of bubble-sort graphs with edge faults;Araki;Inform. Sci.,2007

2. N. Ascheuer, Hamiltonian Path Problems in the On-line Optimization of Flexible Manufacturing Systems, Ph.D. Thesis, University of Technology, Berlin, Germany, 1995.

3. Interconnection networks based on a generatization of cube-connected cycles;Carlsson;IEEE Trans. Comput.,1985

4. Augmented cubes;Choudum;Networks,2002

5. The crossed cube architecture for parallel computation;Efe;IEEE Trans. Paral. Distr. Syst.,1992

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

1. Hamiltonian cycles of balanced hypercube with disjoint faulty edges;Information Processing Letters;2025-01

2. Novel schemes for embedding Hamiltonian paths and cycles in balanced hypercubes with exponential faulty edges;Journal of Parallel and Distributed Computing;2023-07

3. Hamiltonian cycles of balanced hypercube with more faulty edges;Theoretical Computer Science;2023-02

4. Fault-free Hamiltonian paths passing through prescribed linear forests in balanced hypercubes with faulty links;Theoretical Computer Science;2023-01

5. Partition-Edge Fault-Tolerant Hamiltonicity of Pancake Graphs;Communications in Computer and Information Science;2022