Fault-Tolerant Embedding of Pairwise Independent Hamiltonian Paths on a Faulty Hypercube with Edge Faults

@article{Hsieh2008FaultTolerantEO,
  title={Fault-Tolerant Embedding of Pairwise Independent Hamiltonian Paths on a Faulty Hypercube with Edge Faults},
  author={Sun-Yuan Hsieh and Yu-Fen Weng},
  journal={Theory of Computing Systems},
  year={2008},
  volume={45},
  pages={407-425}
}
A Hamiltonian path in G is a path which contains every vertex of G exactly once. Two Hamiltonian paths P 1=〈u 1,u 2,…,u n 〉 and P 2=〈v 1,v 2,…,v n 〉 of G are said to be independent if u 1=v 1, u n =v n , and u i ≠v i for all 1<i<n; and both are full-independent if u i ≠v i for all 1≤i≤n. Moreover, P 1 and P 2 are independent starting at u 1, if u 1=v 1 and u i ≠v i for all 1<i≤n. A set of Hamiltonian paths {P 1,P 2,…,P k } of G are pairwise independent (respectively, pairwise full-independent… CONTINUE READING