Enabling high fault-tolerant embedding capability of alternating group graphs

Published: 01 Jan 2024, Last Modified: 15 Nov 2024Future Gener. Comput. Syst. 2024EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Highlights•We embed Hamiltonian paths/cycles into alternating group graphs under the PEF model.•A Hamiltonian path embedding algorithm is proposed and validated by experiments.•We experimentally assess the average path length of the proposed algorithm.•Our approach enhances the theoretical fault-tolerance to an exponential scale.•The simulation experiments show our excellent fault-tolerant capability in practice.
Loading