Computational complexity of long paths and cycles in faulty hypercubes

The problem of existence of an optimal-length (long) fault-free cycle in the n-dimensional hypercube with f faulty vertices is NP-hard. This holds even in case that f is bounded by a polynomial of degree three (six) with respect to n. On the other hand, there is a linear (quadratic) bound on f which guarantees that the problem is decidable in polynomial time. Similar results are obtained for paths as well as for paths between prescribed endvertices.

[1]  Václav Koubek,et al.  Long paths in hypercubes with a quadratic number of faults , 2009, Inf. Sci..

[2]  Petr Gregor,et al.  Long cycles in hypercubes with optimal number of faulty vertices , 2012, J. Comb. Optim..

[3]  Tomás Dvorák,et al.  Hamiltonian Cycles with Prescribed Edges in Hypercubes , 2005, SIAM J. Discret. Math..

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

[5]  K. Wagner,et al.  The Complexity of Problems Concerning Graphs with Regularities (Extended Abstract) , 1984, MFCS.

[6]  Jung-Sheng Fu.  Fault-tolerant cycle embedding in the hypercube , 2003, Parallel Comput..

[7]  L. Lovász.  Combinatorial problems and exercises , 1979 .

[8]  M. Lewinter,et al.  Hyper-Hamilton Laceable and Caterpillar-Spannable Product Graphs , 1997 .

[9]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10]  Jung-Sheng Fu.  Longest fault-free paths in hypercubes with vertex faults , 2006, Inf. Sci..

[11]  Petr Gregor,et al.  Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices , 2008, SIAM J. Discret. Math..

[12]  Petr Gregor,et al.  Long paths and cycles in hypercubes with faulty vertices , 2009, Inf. Sci..

[13]  Jimmy J. M. Tan,et al.  Long paths in hypercubes with conditional node-faults , 2009, Inf. Sci..

[14]  Nelson Castañeda,et al.  Embedded paths and cycles in faulty hypercubes , 2010, J. Comb. Optim..