Embedding Hamiltonian paths in faulty arrangement graphs with the backtracking method

[1]  Frank Harary,et al.  Distance in graphs , 1990 .

[2]  Gen-Huey Chen,et al.  Hamiltonian-laceability of star graphs , 1997, Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN'97).

[3]  Yu-Chee Tseng,et al.  Fault-Tolerant Ring Embedding in a Star Graph with Both Link and Node Failures , 1997, IEEE Trans. Parallel Distributed Syst..

[4]  Mee Yee Chan,et al.  Distributed Fault-Tolerant Embeddings of Rings in Hypercubes , 1990, J. Parallel Distributed Comput..

[5]  Arkady Kanevsky,et al.  Embedding rings in recursive networks , 1994, Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing.

[6]  Khaled Day,et al.  Arrangement Graphs: A Class of Generalized Star Graphs , 1992, Inf. Process. Lett..

[7]  Sheldon B. Akers,et al.  A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.

[8]  S. Lakshmivarahan,et al.  Embedding of cycles and Grids in Star Graphs , 1991, J. Circuits Syst. Comput..

[9]  Gen-Huey Chen,et al.  Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs , 1999, IEEE Trans. Parallel Distributed Syst..

[10]  Gerard Tel,et al.  Topics in distributed algorithms , 1991 .

[11]  Sheldon B. Akers,et al.  The Star Graph: An Attractive Alternative to the n-Cube , 1994, ICPP.

[12]  Stephen A. Wong.  Hamilton cycles and paths in butterfly graphs , 1995, Networks.

[13]  Khaled Day,et al.  Embedding of Cycles in Arrangement Graphs , 1993, IEEE Trans. Computers.

[14]  Gen-Huey Chen,et al.  Embed longest rings onto star graphs with vertex faults , 1998, Proceedings. 1998 International Conference on Parallel Processing (Cat. No.98EX205).

[15]  Yu-Chee Tseng.  Embedding a Ring in a Hypercube with Both Faulty Links and Faulty Nodes , 1996, Inf. Process. Lett..

[16]  Shahram Latifi,et al.  Hamiltonicity of the Clustered-Star Graph with Embedding Applications , 1996, PDPTA.

[17]  Cauligi S. Raghavendra,et al.  Embedding of Rings and Meshes onto Faulty Hypercubes Using Free Dimensions , 1994, IEEE Trans. Computers.

[18]  Shahram Latifi,et al.  Optimal ring embedding in hypercubes with faulty links , 1992, [1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing.

[19]  Sartaj Sahni,et al.  Embedding Hamiltonians and Hypercubes in Star Interconnection Graphs , 1990, ICPP.

[20]  Mee Yee Chan,et al.  On the Existence of Hamiltonian Circuits in Faulty Hypercubes , 1991, SIAM J. Discret. Math..

[21]  Norbert Ascheuer,et al.  Hamiltonian path problems in the on-line optimization of flexible manufacturing systems , 1996 .

[22]  Khaled Day,et al.  Embedding Grids, Hypercubes, and Trees in Arrangement Graphs , 1993, 1993 International Conference on Parallel Processing - ICPP'93.

[23]  Gen-Huey Chen,et al.  Longest Fault-Free Paths in Star Graphs with Edge Faults , 2001, IEEE Trans. Computers.